Semidefinite code bounds based on quadruple distances

Abstract

Let $A(n,d)$ be the maximum number of $0,1$ words of length $n$, any two having Hamming distance at least $d$. We prove $A(20,8)=256$, which implies that the quadruply shortened Golay code is optimal. Moreover, we show $A(18,6)\le 673$, $A(19,6)\le 1237$, $A(20,6)\le 2279$, $A(23,6)\le 13674$, $A(19,8)\le 135$, $A(25,8)\le 5421$, $A(26,8)\le 9275$, $A(21,10)\le 47$, $A(22,10)\le 84$, $A(24,10)\le 268$, $A(25,10)\le 466$, $A(26,10)\le 836$, $A(27,10)\le 1585$, $A(25,12)\le 55$, and $A(26,12)\le 96$. The method is based on the positive semidefiniteness of matrices derived from quadruples of words. This can be put as constraint in a semidefinite program, whose optimum value is an upper bound for $A(n,d)$. The order of the matrices involved is huge. However, the semidefinite program is highly symmetric, by which its feasible region can be restricted to the algebra of matrices invariant under this symmetry. By block diagonalizing this algebra, the order of the matrices will be reduced so as to make the program solvable with semidefinite programming software in the above range of values of $n$ and $d$.

15 pages

Cited by in corpus (1)

• Applications of semidefinite programming to coding theory