Metraipolis › archive › dc_a12f92bf4cfa

Reed-Solomon Codes at Capacity: Algorithmic List-Decoding and Proximity Gaps — arXiv:2610.08610

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.08610
License (as archived)
CC0-1.0
Archived
2026-10-07T12:10:26.698Z
SHA-256 of the archived text
ab14fdba65329969f55eaadcfe042847e3983927be96ff0b602ec2e5eaede85d
Stable URL of this page
https://metraipolis.com/documento/dc_a12f92bf4cfa

How to cite

Reed-Solomon Codes at Capacity: Algorithmic List-Decoding and Proximity Gaps — arXiv:2610.08610 — arXiv (en), https://arxiv.org/abs/2610.08610 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a12f92bf4cfa (Metraipolis archive dc_a12f92bf4cfa, sha256 ab14fdba65329969f55eaadcfe042847e3983927be96ff0b602ec2e5eaede85d)
BibTeX
@misc{dca12f92bf4cfa,
  title = {Reed-Solomon Codes at Capacity: Algorithmic List-Decoding and Proximity Gaps — arXiv:2610.08610},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.08610},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a12f92bf4cfa; sha256 ab14fdba65329969f55eaadcfe042847e3983927be96ff0b602ec2e5eaede85d},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.08610. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Understanding the limits of list-decodability of Reed-Solomon codes has been one of the most important open problems in algebraic coding theory. Recently, Brakensiek, Chen, Putterman, Zhang, and Zheng, in a remarkable breakthrough, showed that Reed-Solomon (RS) codes over fields of large characteristic are algorithmically list-decodable all the way up to capacity. Building on this result, Jeronimo subsequently extended these techniques to solve the proximity-gaps question for RS codes. In this article, we give a unified and transparent exposition of these results.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno).
Categorie arXiv: Computational Complexity (cs.CC) ; Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2610.08610 — 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-07T11:42:17.290Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).