Berlekamp-Massey algorithm, continued fractions, Padé approximations, and orthogonal polynomials
From MaRDI portal
(Redirected from Publication:2473633)
Recommendations
Cites work
- scientific article; zbMATH DE number 3910296 (Why is no real title available?)
- scientific article; zbMATH DE number 41159 (Why is no real title available?)
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- A method for solving key equation for decoding goppa codes
- Algebraic coding theory
- Continued Fractions and Linear Recurrences
- Continued fractions and Berlekamp's algorithm
- Continued fractions and the Berlekamp-Massey algorithm
- On the continued fraction and Berlekamp's algorithm (Corresp.)
- On the equivalence between Berlekamp's and Euclid's algorithms (Corresp.)
- Shift-register synthesis and BCH decoding
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}\)
- scientific article; zbMATH DE number 3857640 (Why is no real title available?)
- 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)