Exact Completeness of LP Hierarchies for Linear Codes

arXiv2211.01248MaRDI QIDQ6415950FDOQ6415950

Authors: Leonardo Nagami Coregliano, Fernando Granha Jeronimo, Chris V. Jones 

Publication date: 2 November 2022

Abstract: 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^{extLin}(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^{extLin}(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^{extLin}(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.

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Linear codes (general theory) (94B05) Bounds on codes (94B65)

This page was built for publication: Exact Completeness of LP Hierarchies for Linear Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6415950)