Metraipolis › archive › dc_7c2ccfb49141

Algebraic Geometry Codes Approach the Half-Singleton Bound with Constant Field Size — arXiv:2609.05017

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.05017
License (as archived)
CC0-1.0
Archived
2026-10-16T23:21:26.173Z
SHA-256 of the archived text
58fb82b1dc7ddff2f9ca8580aeedd2db764ae6e8970682137a850ac18c941584
Stable URL of this page
https://metraipolis.com/documento/dc_7c2ccfb49141

How to cite

Algebraic Geometry Codes Approach the Half-Singleton Bound with Constant Field Size — arXiv:2609.05017 — arXiv (en), https://arxiv.org/abs/2609.05017 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7c2ccfb49141 (Metraipolis archive dc_7c2ccfb49141, sha256 58fb82b1dc7ddff2f9ca8580aeedd2db764ae6e8970682137a850ac18c941584)
BibTeX
@misc{dc7c2ccfb49141,
  title = {Algebraic Geometry Codes Approach the Half-Singleton Bound with Constant Field Size — arXiv:2609.05017},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.05017},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7c2ccfb49141; sha256 58fb82b1dc7ddff2f9ca8580aeedd2db764ae6e8970682137a850ac18c941584},
  year = {2026}
}

Archived text

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

We study linear codes for insertion and deletion (insdel) errors through the lens of evaluation codes. We develop a general framework for analyzing random puncturings of evaluation codes, where the edit distance is controlled by only the size of the evaluation domain and the maximum number of zeros of a nonzero function in the underlying function space. Our proof generalizes the results of Con, Guo, Li, and Zhang (ICALP 2025), and simultaneously simplifies their arguments by avoiding an in-depth analysis of longest common subsequences. We demonstrate the applicability of our core theorem by instantiating it with random puncturings of Reed--Muller codes. We then recover the result that random Reed--Solomon codes approach the half-Singleton bound over linear-sized fields while also improving the dependence on the additive gap $\varepsilon$ from $2^{O(1/\varepsilon^2)}$ to $2^{O(1/\varepsilon)}$. Finally, by applying the framework to algebraic geometry codes arising from asymptotically good towers of function fields, we show that there exist randomized families of structured linear codes over constant-sized fields that approach the half-Singleton bound.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-07 in math.CO).
Categorie arXiv: Information Theory (cs.IT) ; Data Structures and Algorithms (cs.DS); Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.05017 — 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-16T23:03:13.283Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-07?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).