On the number of correctable errors of the Feng-Rao decoding algorithm for AG codes
From MaRDI portal
Publication:4701440
DOI10.1109/18.771252zbMath0957.94048OpenAlexW2067553256MaRDI QIDQ4701440
Publication date: 21 November 1999
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.771252
Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)
Related Items (3)
A sequence of one-point codes from a tower of function fields ⋮ List decoding algorithm based on voting in Gröbner bases for general one-point AG codes ⋮ ON ASYMPTOTICALLY OPTIMAL TOWERS OVER QUADRATIC FIELDS RELATED TO GAUSS HYPERGEOMETRIC FUNCTIONS
This page was built for publication: On the number of correctable errors of the Feng-Rao decoding algorithm for AG codes