Article Dans Une Revue IEEE Transactions on Information Theory Année : 2025

Faster List Decoding of AG Codes

Résumé

In this article, we present a fast algorithm performing an instance of the Guruswami-Sudan list decoder for algebraic geometry codes. We show that any such code can be decoded in $\tilde{O}(s^2\ell^{\omega-1}\mu^{\omega-1}(n+g) + \ell^\omega \mu^\omega)$ operations in the underlying finite field, where $n$ is the code length, $g$ is the genus of the function field used to construct the code, $s$ is the multiplicity parameter, $\ell$ is the designed list size and $\mu$ is the smallest positive element in the Weierstrass semigroup of some chosen place.

Fichier principal
Vignette du fichier
ag-decoding-faster.pdf (408.65 Ko) Télécharger le fichier

Dates et versions

hal-04069465 , version 1 (14-04-2023)
hal-04069465 , version 2 (10-01-2026)

Licence

Identifiants

Citer

Peter Beelen, Vincent Neiger. Faster List Decoding of AG Codes. IEEE Transactions on Information Theory, 2025, 71 (5), pp.3397-3408. ⟨10.1109/TIT.2025.3550750⟩. ⟨hal-04069465v2⟩
305 Consultations
333 Téléchargements

Altmetric

Partager

  • More