Metraipolis › archive › dc_a2ec63f01275

On Proximity Gaps for One-Point Algebraic Geometric Codes — arXiv:2610.39256

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.39256
License (as archived)
CC0-1.0
Archived
2026-11-01T02:39:42.118Z
SHA-256 of the archived text
255c40bbd758861d95499675af56a230e656ca5eeb18d88edf0980af89ebac1c
Stable URL of this page
https://metraipolis.com/documento/dc_a2ec63f01275

How to cite

On Proximity Gaps for One-Point Algebraic Geometric Codes — arXiv:2610.39256 — arXiv (en), https://arxiv.org/abs/2610.39256 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a2ec63f01275 (Metraipolis archive dc_a2ec63f01275, sha256 255c40bbd758861d95499675af56a230e656ca5eeb18d88edf0980af89ebac1c)
BibTeX
@misc{dca2ec63f01275,
  title = {On Proximity Gaps for One-Point Algebraic Geometric Codes — arXiv:2610.39256},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.39256},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a2ec63f01275; sha256 255c40bbd758861d95499675af56a230e656ca5eeb18d88edf0980af89ebac1c},
  year = {2026}
}

Archived text

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

Proximity gaps and correlated agreement underpin the soundness of interactive oracle proofs. We establish these properties for general one-point algebraic geometry (AG) codes, extending corresponding results for Reed-Solomon codes. For codes of length $n$ over $\mathbb F_q$ with designed distance $n-m$, write $\rho=m/n$ and fix $\rho\in(0,1)$. For polynomial curves of degree at most $\ell$ and any $0<\varepsilon<1$, we prove correlated agreement with multiplicative slack $\varepsilon$ and soundness $O(\ell(\ell+1)/(\varepsilon q))$ whenever $e\le(1-\varepsilon)(n-m)/2$, with no additional genus penalty. This gives asymptotically good AG code families from Garcia--Stichtenoth tower of unbounded length over a fixed field with soundness bounds independent of $n$, beyond the RS restriction $n\le q$. We also establish mutual correlated agreement up to radius $(1-\sqrt{\rho}-\eta)n$, with soundness $O(\ell n/(\eta^3q))$ for $0<\eta<1-\sqrt{\rho}$. Our half designed distance proof combines auxiliary divisors, simultaneous Berlekamp-Welch interpolation, and error-incidence counting to obtain a common polynomial representation without a Polishchuk-Spielman divisibility lemma. Finally, two counterexamples on the Garcia-Stichtenoth tower show limitations beyond half the minimum distance, at radii below the Johnson bound and with positive slack. The first requires a positive constant soundness lower bound independent of $q$ and $n$, precluding a uniform $O(1/q)$ guarantee throughout the Johnson regime. The second fixes the field and lets the relative gap above half distance tend to zero while ruling out correlated agreement for every soundness parameter $\sigma<1$, with positive limiting rate and relative error radius.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2610.39256 — 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-01T02:15:43.725Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).