arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1005.4959math.CO
收藏

基于四重距离的半定码界

Semidefinite code bounds based on quadruple distances

Dion C. Gijswijt, Hans D. Mittelmann, Alexander Schrijver

摘要:

令$A(n,d)$为长度为$n$的$0,1$字的最大数目,任何两个具有至少$d$的汉明距离。我们证明$A(20,8)=256$,这意味着四倍缩短Golay码是最佳的。此外,我们还显示了$A(18,6)\leq 673$、$A(19,6)\leq 1237$、$A(20,6)\leq 2279$、$A(23,6)\leq 13674$、$A(19,8)\leq 135$、$A(25,8)\leq 5421$、$A(26,8)\leq 9275$、$A(21,10)\leq 47$、$A(22,10)\leq 84$、$A(24,10)\leq 268$、$A(25,10)\leq 466$、$A(26,10)\leq 836$、$A(27,10)\leq 1585$、$A(25,12)\leq 55$和$A(26,12)\leq 96$。该方法是基于正半定矩阵的四元组的话。这可以作为半定规划中的约束,其最优值是$A(n,d)$的上界。所涉及的矩阵的阶数是巨大的。然而,半定规划是高度对称的,它的可行域可以被限制为在这种对称下不变的矩阵代数。通过块对角化该代数,矩阵的阶将被降低,从而使程序在上述$n$和$d$的值范围内用半定编程软件可解。

英文摘要:

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)\leq 673$, $A(19,6)\leq 1237$, $A(20,6)\leq 2279$, $A(23,6)\leq 13674$, $A(19,8)\leq 135$, $A(25,8)\leq 5421$, $A(26,8)\leq 9275$, $A(21,10)\leq 47$, $A(22,10)\leq 84$, $A(24,10)\leq 268$, $A(25,10)\leq 466$, $A(26,10)\leq 836$, $A(27,10)\leq 1585$, $A(25,12)\leq 55$, and $A(26,12)\leq 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$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑