The Berlekamp-Massey algorithm revisited
From MaRDI portal
Publication:2502174
DOI10.1007/S00200-005-0190-ZzbMATH Open1107.11311OpenAlexW2047006437MaRDI QIDQ2502174FDOQ2502174
Authors: Nadia Ben Atti, Gema Maria Diaz Toca, 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
Recommendations
- scientific article; zbMATH DE number 820495
- On Berlekamp-Massey and Berlekamp-Massey-Sakata algorithms
- A simple derivation of the Berlekamp- Massey algorithm and some applications (Corresp.)
- On the matrix Berlekamp-Massey algorithm
- Extension of the Berlekamp-Massey algorithm to N dimensions
- scientific article; zbMATH DE number 1498815
- ON THE BERLEKAMP — MASSEY ALGORITHM AND ITS APPLICATION FOR DECODING ALGORITHMS
- A generalization of the Massey-Ding algorithm
- Computational Science - ICCS 2004
- A fraction free matrix Berlekamp/Massey algorithm
Symbolic computation and algebraic computation (68W30) Recurrences (11B37) Number-theoretic algorithms; complexity (11Y16)
Cites Work
- Algebraic coding theory
- Title not available (Why is that?)
- Shift-register synthesis and BCH decoding
- New techniques for the computation of linear recurrence coefficients
- A method for solving key equation for decoding goppa codes
- On the continued fraction and Berlekamp's algorithm (Corresp.)
- Continued Fractions and Linear Recurrences
- Continued fractions and Berlekamp's algorithm
- A simple Hankel interpretation of the Berlekamp-Massey algorithm
- On the equivalence between Berlekamp's and Euclid's algorithms (Corresp.)
Cited In (17)
- A generalization of the Massey-Ding algorithm
- A simple derivation of the Berlekamp- Massey algorithm and some applications (Corresp.)
- Title not available (Why is that?)
- An interpolation algorithm for computing Dixon resultants
- ON THE BERLEKAMP — MASSEY ALGORITHM AND ITS APPLICATION FOR DECODING ALGORITHMS
- A fast parallel sparse polynomial GCD algorithm
- In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: the adaptive variants
- Computational Science - ICCS 2004
- On the matrix Berlekamp-Massey algorithm
- The Berlekamp-Massey Algorithm revisited
- Block diagonalization and LU-equivalence of Hankel matrices
- The BMS Algorithm
- On Berlekamp-Massey and Berlekamp-Massey-Sakata algorithms
- Recovering highly-complex linear recurrences of integer sequences
- Solving Parametric Linear Systems Using Sparse Rational Function Interpolation
- Galois theory, splitting fields and computer algebra
- A fraction free matrix Berlekamp/Massey algorithm
This page was built for publication: The Berlekamp-Massey algorithm revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2502174)
