On the equivalence of the Berlekamp-Massey and the Euclidean algorithms for decoding

DOI10.1109/18.887869zbMath1028.94038OpenAlexW2110667766MaRDI QIDQ2705988

Jørn M. Jensen, Agnes Eileen Heydtmann

Publication date: 19 March 2001

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.887869

zbMATH Keywords

Reed-Solomon codesalternant codesEuclidean algorithmBerlekamp-Massey algorithmkey equationsyndromesfundamental iterative algorithm

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Decoding (94B35) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Related Items

Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field ⋮ A Decoding Approach to Reed–Solomon Codes from Their Definition