The Berlekamp-Massey algorithm revisited

DOI10.1007/s00200-005-0190-zzbMath1107.11311OpenAlexW2047006437MaRDI QIDQ2502174

Gema Maria Diaz Toca, Nadia Ben Atti, Henri Lombardi

Publication date: 12 September 2006

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-005-0190-z

zbMATH Keywords

Berlekamp-Massey algorithmlinearly recurrent sequences

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Recurrences (11B37)

Related Items

Galois theory, splitting fields and computer algebra, A fast parallel sparse polynomial GCD algorithm, Block diagonalization and LU-equivalence of Hankel matrices, An interpolation algorithm for computing Dixon resultants

Cites Work

• Unnamed Item
• Unnamed Item
• A simple Hankel interpretation of the Berlekamp-Massey algorithm
• New techniques for the computation of linear recurrence coefficients
• On the continued fraction and Berlekamp's algorithm (Corresp.)
• On the equivalence between Berlekamp's and Euclid's algorithms (Corresp.)
• A method for solving key equation for decoding goppa codes
• Continued Fractions and Linear Recurrences
• Continued fractions and Berlekamp's algorithm
• Shift-register synthesis and BCH decoding