A fast parallel implementation of a Berlekamp-Massey algorithm for algebraic-geometric codes

DOI10.1109/18.681314zbMath0994.94037OpenAlexW2097821905MaRDI QIDQ4701109

R. Kötter

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

zbMATH Keywords

algebraic-geometric codesdecodingReed-Solomon codeserror locating functionsparallel Berlekamp-Massey algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)

Related Items (3)

List decoding algorithm based on voting in Gröbner bases for general one-point AG codes ⋮ List decoding of Hermitian codes using Gröbner bases ⋮ The key equation for one-point codes and efficient error evaluation

This page was built for publication: A fast parallel implementation of a Berlekamp-Massey algorithm for algebraic-geometric codes