Performance analysis of a decoding algorithm for algebraic-geometry codes

DOI10.1109/18.771253MaRDI QIDQ4701441zbMATH OpenOpenAlexFDO

Authors Helge Elbrond Jensen, Rasmus Nielsen, 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://orbit.dtu.dk/en/publications/04d2d355-afa1-4fe1-8a63-e18bbc3f537a

zbMATH Keywords

algebraic-geometric codesfast decoding algorithmperformance

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 493096
• On the decoding of algebraic-geometric codes
• On the decoding of algebraic-geometric codes
• On the decoding of algebraic-geometric codes
• scientific article; zbMATH DE number 5568409
• scientific article; zbMATH DE number 107496
• scientific article; zbMATH DE number 5529001
• Simplified understanding and efficient decoding of a class of algebraic-geometric codes
• scientific article; zbMATH DE number 1775409
• Construction and decoding of a class of algebraic geometry codes

Cited in

(6)

• Redundancies of correction capability optimized Reed-Muller codes
• Improved power decoding of interleaved one-point Hermitian codes
• Fast erasure-and-error decoding of algebraic geometry codes up to the Feng-Rao bound
• scientific article; zbMATH DE number 1839528 (Why is no real title available?)
• List decoding algorithm based on voting in Gröbner bases for general one-point AG codes
• The correction capability of the Berlekamp-Massey-Sakata algorithm with majority voting

This page was built for publication: Performance analysis of a decoding algorithm for algebraic-geometry codes

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