Metraipolis › archive › dc_3434bf37ef5c
A proof of the generalized packing-covering conjecture — arXiv:2609.34910
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.34910
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T23:29:32.352Z
- SHA-256 of the archived text
100cd3c26df5abb729074da98784663a1d7d41c55f23a8135b4d15c0c86f4002- Stable URL of this page
https://metraipolis.com/documento/dc_3434bf37ef5c
How to cite
A proof of the generalized packing-covering conjecture — arXiv:2609.34910 — arXiv (en), https://arxiv.org/abs/2609.34910 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3434bf37ef5c (Metraipolis archive dc_3434bf37ef5c, sha256 100cd3c26df5abb729074da98784663a1d7d41c55f23a8135b4d15c0c86f4002)
BibTeX
@misc{dc3434bf37ef5c,
title = {A proof of the generalized packing-covering conjecture — arXiv:2609.34910},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.34910},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3434bf37ef5c; sha256 100cd3c26df5abb729074da98784663a1d7d41c55f23a8135b4d15c0c86f4002},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.34910. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The generalized packing--covering conjecture of Elimelech, Firer and Schwartz asserts that, for every linear code $\mathcal{C}$ and every admissible order $t$, the $t$-th generalized Hamming weight $d_t(\mathcal{C})$ and the $t$-th generalized covering radius $R_t(\mathcal{C})$ satisfy $d_t(\mathcal{C})\le 2R_t(\mathcal{C})+2$. We give a computer-assisted proof of the conjecture for every linear code over every finite field and every admissible order. Combining a parity-check reformulation of the conjecture, bounds on the length of putative counterexamples, and successive puncturing arguments, we settle all orders $t\ge 32$ and reduce the remaining orders to finitely many parameter tuples, which we exclude by an exact computer verification.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-29 in math.CO).
Categorie arXiv: Information Theory (cs.IT) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.34910 — 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-07T23:08:10.920Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).