On the equivalence between Berlekamp's and Euclid's algorithms (Corresp.)

DOI10.1109/TIT.1987.1057299zbMath0633.94019MaRDI QIDQ3772131

Jean-Louis Dornstetter

Publication date: 1987

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

zbMATH Keywords

decoding algorithmsEuclid algorithmgreatest common divisor of polynomialsdecoding of BCH codesBerlekamp iterative algorithm

Mathematics Subject Classification ID

Decoding (94B35)

Related Items (13)

Polynomial-division-based algorithms for computing linear recurrence relations ⋮ Rational complexity of binary sequences, F\(\mathbb{Q}\)SRs, and pseudo-ultrametric continued fractions in \(\mathbb{R}\) ⋮ The Berlekamp-Massey algorithm and linear recurring sequences over a factorial domain ⋮ A Decoding Approach to Reed–Solomon Codes from Their Definition ⋮ ON THE BERLEKAMP — MASSEY ALGORITHM AND ITS APPLICATION FOR DECODING ALGORITHMS ⋮ Univariate polynomial factorization over finite fields ⋮ A fraction free matrix Berlekamp/Massey algorithm ⋮ Berlekamp-Massey algorithm, continued fractions, Padé approximations, and orthogonal polynomials ⋮ Subquadratic-time factoring of polynomials over finite fields ⋮ The Berlekamp-Massey algorithm revisited ⋮ On Elkies subgroups of \(\ell\)-torsion points in elliptic curves defined over a finite field ⋮ Euclid’s algorithm and the Lanczos method over finite fields ⋮ Block diagonalization and LU-equivalence of Hankel matrices

This page was built for publication: On the equivalence between Berlekamp's and Euclid's algorithms (Corresp.)