Metraipolis › archive › dc_d2acf5f170e7
Combinatorial limitations of list-decoding Reed-Solomon codes — arXiv:2611.07607
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.07607
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-06T14:53:03.131Z
- SHA-256 of the archived text
0814c5321742086639f17459201b221bf5b9feb613131b9ef63179c39539c489- Stable URL of this page
https://metraipolis.com/documento/dc_d2acf5f170e7
How to cite
Combinatorial limitations of list-decoding Reed-Solomon codes — arXiv:2611.07607 — arXiv (en), https://arxiv.org/abs/2611.07607 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d2acf5f170e7 (Metraipolis archive dc_d2acf5f170e7, sha256 0814c5321742086639f17459201b221bf5b9feb613131b9ef63179c39539c489)
BibTeX
@misc{dcd2acf5f170e7,
title = {Combinatorial limitations of list-decoding Reed-Solomon codes — arXiv:2611.07607},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.07607},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d2acf5f170e7; sha256 0814c5321742086639f17459201b221bf5b9feb613131b9ef63179c39539c489},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.07607. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
For infinitely many rates $R \in (0,1)$, we show that full-length Reed-Solomon codes over fields of low characteristic can contain super-polynomially many codewords in a Hamming ball of radius just exceeding the Johnson radius. Over prime fields, we exhibit full-length Reed-Solomon codes of constant rate $R$ with polynomially many codewords in a Hamming ball of relative radius bounded strictly below $1-R$. This refutes a recent conjecture that, over prime fields, list sizes below capacity are always bounded by a constant. Together, these results demonstrate that certain restrictions in recent works on explicit Reed-Solomon codes achieving list-decoding capacity, related to the choice of field or evaluation points or to the list-size guarantee, are inherent. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno). Categorie arXiv: Information Theory (cs.IT) ; Computational Complexity (cs.CC). Pagina del lavoro: https://arxiv.org/abs/2611.07607 — 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-11-06T14:24:46.057Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).