Metraipolis › archive › dc_fef06c25f97d
Average-Radius List-Decodability of Random Linear Codes — arXiv:2608.22663
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.22663
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T08:35:59.496Z
- SHA-256 of the archived text
14297c9218a38f6b8f867cc4835d17a4a6a0fd856dc67c163a43bc62b3ca2845- Stable URL of this page
https://metraipolis.com/documento/dc_fef06c25f97d
How to cite
Average-Radius List-Decodability of Random Linear Codes — arXiv:2608.22663 — arXiv (en), https://arxiv.org/abs/2608.22663 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fef06c25f97d (Metraipolis archive dc_fef06c25f97d, sha256 14297c9218a38f6b8f867cc4835d17a4a6a0fd856dc67c163a43bc62b3ca2845)
BibTeX
@misc{dcfef06c25f97d,
title = {Average-Radius List-Decodability of Random Linear Codes — arXiv:2608.22663},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.22663},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fef06c25f97d; sha256 14297c9218a38f6b8f867cc4835d17a4a6a0fd856dc67c163a43bc62b3ca2845},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.22663. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We prove that for every prime power $q$ and every $p \in (0, 1-1/q)$, a random $\mathbb{F}_q$-linear code of rate $1 - h_q(p) - \epsilon$ is $(p, C_{p,q}/\epsilon)$-average-radius list-decodable with probability at least $1 - q^{-\Omega(n)}$, i.e., for every center $y \in \mathbb{F}_q^n$, the $C_{p,q}/\epsilon$ codewords closest to $y$ have average fractional Hamming distance at least $p$ from $y$. This extends a similar result for (standard) list-decoding due to Guruswami, Håstad, and Kopparty (2010) to the stronger average-radius guarantee, with the same $O(1/\epsilon)$ list size. For average-radius list-decoding, such a result was previously known only for binary linear codes (Guruswami, Li, Mosheiff, Resch, Silas, and Wootters, 2021) and for general (non-linear) random codes over arbitrary alphabets (Elias, 1991).
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-25 in math.CO).
Categorie arXiv: Information Theory (cs.IT) ; Computational Complexity (cs.CC); Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.22663 — 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-18T08:27:54.476Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).