2026/08/06 by Shujian Li, Hengjia Wei, Maosheng Xiong
Computer Science · Mathematics · #cs.IT #math.CO #math.IT
Comments are welcome
arxiv created 2026/08/06 · arxiv updated 2026/08/07
In this paper we derive new Delsarte-type linear programming bounds for q-ary (r,δ)-locally recoverable codes (LRCs) with three attributes: first, the variable set is comparable in size to that of the classical Delsarte LP; second, our LP exploits the higher-order information forced by the local-distance condition through order \(δ-2\), in the sense that for nondegenerate linear codes, its balanced base part gives exactly the same dimension bound as the symmetrized refined-weight LP of Gruica, Jany, and Ravagnani, while the additional constraints, nonvacuous whenever δ≥ 3, give a further strengthening; and third, it applies to general (r,δ)-LRCs, linear and nonlinear alike. Extensive computations over binary and ternary alphabets show that the convex-hull LP yields improvements not captured by the previous LP and often sharpens the shortening and generalized Singleton bounds.