Performance analysis of a decoding algorithm for algebraic-geometry codes

DOI10.1109/18.771253zbMath0957.94049OpenAlexW2112639232MaRDI QIDQ4701441

Tom Høholdt, Rasmus Nielsen, Helge Elbrond Jensen

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

performancealgebraic-geometric codesfast decoding algorithm

Mathematics Subject Classification ID

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

Related Items (4)

The correction capability of the Berlekamp-Massey-Sakata algorithm with majority voting ⋮ Improved power decoding of interleaved one-point Hermitian codes ⋮ List decoding algorithm based on voting in Gröbner bases for general one-point AG codes ⋮ Redundancies of correction capability optimized Reed-Muller codes

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