Berlekamp-Massey algorithm, continued fractions, Padé approximations, and orthogonal polynomials
From MaRDI portal
Publication:2473633
DOI10.1007/S11006-006-0004-ZzbMATH Open1206.94114OpenAlexW2030584130MaRDI QIDQ2473633FDOQ2473633
Authors: I. B. Gashkov, S. 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
Recommendations
continued fractionLaurent seriesorthogonal polynomialBerlekamp-Massey algorithmEuclid's algorithmPadé approximations
Cites Work
- Title not available (Why is that?)
- Algebraic coding theory
- Shift-register synthesis and BCH decoding
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- On the equivalence between Berlekamp's and Euclid's algorithms (Corresp.)
- Continued fractions and the Berlekamp-Massey algorithm
Cited In (7)
- Schur's algorithm, orthogonal polynomials, and convergence of Wall's continued fractions in \(L^2(\mathbb{T})\).
- Decoding algorithm as a moment problem related to the extended Lotka–Volterra system
- Computational Science - ICCS 2004
- Continued fractions and the Berlekamp-Massey algorithm
- Multi-continued fraction algorithm and generalized B--M algorithm over \(\mathbb F_{q}\)
- Title not available (Why is that?)
- On the continued fraction and Berlekamp's algorithm (Corresp.)
This page was built for publication: Berlekamp-Massey algorithm, continued fractions, Padé approximations, and orthogonal polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2473633)
