On the number of correctable errors of the Feng-Rao decoding algorithm for AG codes

DOI10.1109/18.771252MaRDI QIDQ4701440zbMATH OpenOpenAlexFDO

Authors Hao Chen

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

zbMATH Keywords

algebraic-geometric codesFeng-Rao decoding algorithmGarcia-Stichtenoth curvesgeometric codes

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)

Recommendations

• On the number of correctable errors for some AG-codes
• Fast erasure-and-error decoding of algebraic geometry codes up to the Feng-Rao bound
• On the decoding of algebraic-geometric codes
• On the decoding of algebraic-geometric codes over F/sub q/ for q<or=16

Cited in

(5)

• A sequence of one-point codes from a tower of function fields
• On the number of correctable errors for some AG-codes
• scientific article; zbMATH DE number 1839528 (Why is no real title available?)
• On asymptotically optimal towers over quadratic fields related to Gauss hypergeometric functions
• List decoding algorithm based on voting in Gröbner bases for general one-point AG codes

This page was built for publication: On the number of correctable errors of the Feng-Rao decoding algorithm for AG codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701440)