Performance analysis of a decoding algorithm for algebraic-geometry codes

DOI10.1109/18.771253zbMATH Open0957.94049OpenAlexW2112639232MaRDI QIDQ4701441FDOQ4701441

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

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
• 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

zbMATH Keywords

performancealgebraic-geometric codesfast decoding algorithm

Mathematics Subject Classification ID

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

Cited In (5)

• Title not available (Why is that?)
• List decoding algorithm based on voting in Gröbner bases for general one-point AG codes
• Redundancies of correction capability optimized Reed-Muller codes
• The correction capability of the Berlekamp-Massey-Sakata algorithm with majority voting
• Improved power decoding of interleaved one-point Hermitian codes

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)