A simple Hankel interpretation of the Berlekamp-Massey algorithm

DOI10.1016/0024-3795(89)90032-3MaRDI QIDQ1825176zbMATH OpenOpenAlexWikidataFDO

Authors Edmund Jonckheere, Chingwo Ma

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

zbMATH Keywords

Hankel matricesBerlekamp-Massey algorithmdecoding Bose-Chaudhuri-Hocquengheim codesHankel system of equationsIohvidov indexlinear feedback shift register lengthLU factorization of the Hankel matrix

Mathematics Subject Classification ID

Recurrences (11B37) Decoding (94B35)

Recommendations

• scientific article; zbMATH DE number 820495
• On Berlekamp-Massey and Berlekamp-Massey-Sakata algorithms
• Computational Science - ICCS 2004
• ON THE BERLEKAMP — MASSEY ALGORITHM AND ITS APPLICATION FOR DECODING ALGORITHMS
• On the Berlekamp/Massey algorithm and counting singular Hankel matrices over a finite field

Cites work

• scientific article; zbMATH DE number 3138903 (Why is no real title available?)
• scientific article; zbMATH DE number 3845443 (Why is no real title available?)
• scientific article; zbMATH DE number 3661196 (Why is no real title available?)
• scientific article; zbMATH DE number 3775748 (Why is no real title available?)
• scientific article; zbMATH DE number 3318360 (Why is no real title available?)
• A simple derivation of the Berlekamp- Massey algorithm and some applications (Corresp.)
• Certain continued fractions associated with the Padé table
• Combined sequence of Markov parameters and moments in linear systems
• Expansion of power series into \(P\)-fractions
• Fast solution of toeplitz systems of equations and computation of Padé approximants
• On the partial realization problem
• Shift-register synthesis and BCH decoding

Cited in

(16)

• Minimal partial realization by descriptor systems
• Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences
• Block diagonalization and LU-equivalence of Hankel matrices
• Linear feedback shift registers and the minimal realization problem
• Polynomial-division-based algorithms for computing linear recurrence relations
• A simple derivation of the Berlekamp- Massey algorithm and some applications (Corresp.)
• On the Berlekamp/Massey algorithm and counting singular Hankel matrices over a finite field
• A fast method to diagonalize a Hankel matrix
• Sparse FGLM algorithms
• The Berlekamp-Massey algorithm revisited
• An algorithm for constructing a minimal partial realization in the multivariable case
• Interpolation of dense and sparse rational functions and other improvements in \texttt{FireFly}
• In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: the adaptive variants
• Recursive partial realization from the combined sequence of Markov parameters and moments
• The Lanczos algorithm and Hankel matrix factorization
• A look-ahead algorithm for the solution of general Hankel systems

This page was built for publication: A simple Hankel interpretation of the Berlekamp-Massey algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1825176)