Fast erasure-and-error decoding of algebraic geometry codes up to the Feng-Rao bound

DOI10.1109/18.681332MaRDI QIDQ4701127zbMATH OpenOpenAlexFDO

Authors Shojiro Sakata, Douglas A. Leonard, Helge Elbrond Jensen, Tom Høholdt

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.681332

zbMATH Keywords

algebraic-geometry codeserasure decodingerror decodingSakata's algorithm

Mathematics Subject Classification ID

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

Recommendations

• Fast decoding of algebraic-geometric codes up to the designed minimum distance
• scientific article; zbMATH DE number 2077100
• Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound
• Performance analysis of a decoding algorithm for algebraic-geometry codes

Cited in

(9)

• A fast decoding method of AG codes from Miura-Kamiya curves \(C_{ab}\) up to half the Feng-Rao bound
• An improvement of the Feng-Rao bound for primary codes
• Feng-Rao decoding of primary codes
• scientific article; zbMATH DE number 2077100 (Why is no real title available?)
• A fast parallel implementation of a Berlekamp-Massey algorithm for algebraic-geometric codes
• On the number of correctable errors of the Feng-Rao decoding algorithm for AG codes
• Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound
• Fast generalized minimum-distance decoding of algebraic-geometry and Reed-Solomon codes
• The correction capability of the Berlekamp-Massey-Sakata algorithm with majority voting

This page was built for publication: Fast erasure-and-error decoding of algebraic geometry codes up to the Feng-Rao bound

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