A simple Hankel interpretation of the Berlekamp-Massey algorithm
From MaRDI portal
Publication:1825176
DOI10.1016/0024-3795(89)90032-3zbMath0683.94010OpenAlexW2008839733WikidataQ61687328 ScholiaQ61687328MaRDI QIDQ1825176
Publication date: 1989
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(89)90032-3
Hankel matricesBerlekamp-Massey algorithmdecoding Bose-Chaudhuri-Hocquengheim codesHankel system of equationsIohvidov indexlinear feedback shift register lengthLU factorization of the Hankel matrix
Related Items
A look-ahead algorithm for the solution of general Hankel systems, Polynomial-division-based algorithms for computing linear recurrence relations, Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences, A fast method to diagonalize a Hankel matrix, An algorithm for constructing a minimal partial realization in the multivariable case, In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: the adaptive variants, Interpolation of dense and sparse rational functions and other improvements in \texttt{FireFly}, Sparse FGLM algorithms, The Lanczos algorithm and Hankel matrix factorization, Linear feedback shift registers and the minimal realization problem, Minimal partial realization by descriptor systems, The Berlekamp-Massey algorithm revisited, Recursive partial realization from the combined sequence of Markov parameters and moments
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Certain continued fractions associated with the Padé table
- Expansion of power series into \(P\)-fractions
- On the partial realization problem
- A simple derivation of the Berlekamp- Massey algorithm and some applications (Corresp.)
- Combined sequence of Markov parameters and moments in linear systems
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- Shift-register synthesis and BCH decoding
