Continued fractions and the Berlekamp-Massey algorithm
From MaRDI portal
Publication:3972877
Recommendations
- Computational Science - ICCS 2004
- Refined convergents to the associated continued fractions for binary sequences
- scientific article; zbMATH DE number 820495
- On the continued fraction and Berlekamp's algorithm (Corresp.)
- Berlekamp-Massey algorithm, continued fractions, Padé approximations, and orthogonal polynomials
Cited in
(15)- scientific article; zbMATH DE number 1552278 (Why is no real title available?)
- Berlekamp-Massey algorithm, continued fractions, Padé approximations, and orthogonal polynomials
- Decoding algorithm as a moment problem related to the extended Lotka–Volterra system
- Computational Science - ICCS 2004
- Feedback shift registers, 2-adic span, and combiners with memory
- An application of a qd‐type discrete hungry Lotka–Volterra equation over finite fields to a decoding problem
- Refined convergents to the associated continued fractions for binary sequences
- Linear recurring sequences over rings and modules
- An approach to an arithmetic analog of Berlekamp's algorithm (Corresp.)
- Implementation of Multi-continued Fraction Algorithm and Application to Multi-sequence Linear Synthesis
- Multi-continued Fraction Algorithm and Generalized B-M Algorithm over F 2
- On sequences, rational functions and decomposition
- Multi-continued fraction algorithm and generalized B--M algorithm over \(\mathbb F_{q}\)
- A fraction free matrix Berlekamp/Massey algorithm
- On the continued fraction and Berlekamp's algorithm (Corresp.)
This page was built for publication: Continued fractions and the Berlekamp-Massey algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3972877)
