New code bounds with algebra and semidefinite programming

by Alexander Schrijver

Abstract:
The linear programming bound of Delsarte is a classical upper bound on
the size of a code of given word length and given minimum distance.
With semidefinite programming this bound can be strengthened, yielding
several improved upper bounds for concrete pairs of word length and
minimum distance.
Basic ingredient is the block diagonalization of the Terwilliger
algebra of the Hamming cube.
In the talk we will explain the method.