Metraipolis › archive › dc_6465f89e5bfe
Multi-View Block Distance Distributions and Linear Programming Bounds for Locally Recoverable Codes with Availability — arXiv:2609.39230
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.39230
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T14:19:19.297Z
- SHA-256 of the archived text
4cc3ac8467772e1e8b68ede698e0a495efe8bcc0bf8ef7a4df3ceada1262790b- Stable URL of this page
https://metraipolis.com/documento/dc_6465f89e5bfe
How to cite
Multi-View Block Distance Distributions and Linear Programming Bounds for Locally Recoverable Codes with Availability — arXiv:2609.39230 — arXiv (en), https://arxiv.org/abs/2609.39230 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6465f89e5bfe (Metraipolis archive dc_6465f89e5bfe, sha256 4cc3ac8467772e1e8b68ede698e0a495efe8bcc0bf8ef7a4df3ceada1262790b)
BibTeX
@misc{dc6465f89e5bfe,
title = {Multi-View Block Distance Distributions and Linear Programming Bounds for Locally Recoverable Codes with Availability — arXiv:2609.39230},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.39230},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6465f89e5bfe; sha256 4cc3ac8467772e1e8b68ede698e0a495efe8bcc0bf8ef7a4df3ceada1262790b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.39230. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We develop a multi-view linear-programming framework for locally recoverable codes with arbitrary fixed availability $a$. For any retained order $1 \le s \le a$, the selected helper sets, the recovered coordinate, and their complement form an $(s+2)$-part partition. Recording the Hamming distance on all blocks preserves both compatibility among the selected repair alternatives and their coupling with the remaining coordinates. The resulting joint distribution satisfies centered counting identities, product-Krawtchouk positivity, and collision inequalities from the local-distance condition; for fixed $s$, these constraints give a polynomial-size relaxation for arbitrary, possibly nonlinear, codes over any finite field. Retaining one view recovers the three-block model of our companion paper. We develop the first genuinely multi-view case, $s=2$, in detail and specialize the exact computations to availability $a=2$. The resulting four-block LP projects to both the one-view three-block model and a globally conditioned two-view relaxation, making explicit the information lost by each coarsening. Exact rational primal-dual certificates together with checked constructions prove $M_{\max}(2,8,4,2,2,2)=8$, $M_{\max}(3,7,3,2,2,2)=27$, and $M_{\max}(4,7,3,2,2,2)=64$; in all three cases the four-block bound is strictly stronger than both coarsenings.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-01 in math.CO).
Categorie arXiv: Information Theory (cs.IT) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.39230 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T14:05:16.454Z dalla pagina https://arxiv.org/catchup/math.CO/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).