Berlekamp-Massey algorithm, continued fractions, Padé approximations, and orthogonal polynomials
From MaRDI portal
Publication:2473633
DOI10.1007/s11006-006-0004-zzbMath1206.94114OpenAlexW2030584130MaRDI QIDQ2473633
I. B. Gashkov, Sergey B. Gashkov
Publication date: 4 March 2008
Published in: Mathematical Notes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11006-006-0004-z
Padé approximationscontinued fractionLaurent seriesBerlekamp-Massey algorithmorthogonal polynomialEuclid's algorithm
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the continued fraction and Berlekamp's algorithm (Corresp.)
- On the equivalence between Berlekamp's and Euclid's algorithms (Corresp.)
- Continued fractions and the Berlekamp-Massey algorithm
- 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