arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2211.01248cs.ITcs.DMmath.COmath.IT
收藏

线性码的LP谱系的精确完备性

Exact Completeness of LP Hierarchies for Linear Codes

Leonardo Nagami Coregliano, Fernando Granha Jeronimo, Chris Jones

摘要:

确定块长度为$n$和距离为$d$的二进制码的最大长度$A_2(n,d)$仍然是一个难以捉摸的公开问题,即使局限于重要的线性码类。最近,两个线性规划层次扩展Delsarte的LP独立提出的上限$A_2^{\text{Lin}}(n,d)$($A_2(n,d)$的线性码的模拟)。其中一个层次,作者,被证明是近似完整的意义上,层次收敛到$A_2^{\text{Lin}}(n,d)$的水平增长超过$n^2$。尽管有一些结构上的相似之处,但Loyfer和Linial的其他层次结构甚至没有近似的完整性。在这项工作中,我们证明了这两个层次恢复$A_2^{\text{Lin}}(n,d)$的确切值在$n$级。我们还证明了在这个层次上的多胞形的Loyfer和Linial是integral.Even虽然这些层次似乎不如一般层次,如平方和强大,我们表明,他们有足够的结构,通过伪概率产生精确的完备性。

英文摘要:

Determining the maximum size $A_2(n,d)$ of a binary code of blocklength $n$ and distance $d$ remains an elusive open question even when restricted to the important class of linear codes. Recently, two linear programming hierarchies extending Delsarte's LP were independently proposed to upper bound $A_2^{\text{Lin}}(n,d)$ (the analogue of $A_2(n,d)$ for linear codes). One of these hierarchies, by the authors, was shown to be approximately complete in the sense that the hierarchy converges to $A_2^{\text{Lin}}(n,d)$ as the level grows beyond $n^2$. Despite some structural similarities, not even approximate completeness was known for the other hierarchy by Loyfer and Linial. In this work, we prove that both hierarchies recover the exact value of $A_2^{\text{Lin}}(n,d)$ at level $n$. We also prove that at this level the polytope of Loyfer and Linial is integral.Even though these hierarchies seem less powerful than general hierarchies such as Sum-of-Squares, we show that they have enough structure to yield exact completeness via pseudoprobabilities.

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

↑