On the matrix Berlekamp-Massey algorithm
From MaRDI portal
Recommendations
Cited in
(17)- Linear feedback shift registers and the minimal realization problem
- On Berlekamp-Massey and Berlekamp-Massey-Sakata algorithms
- In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: the adaptive variants
- A fraction free matrix Berlekamp/Massey algorithm
- The Berlekamp-Massey algorithm revisited
- Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences
- A simple derivation of the Berlekamp- Massey algorithm and some applications (Corresp.)
- The BMS Algorithm
- On the Berlekamp/Massey algorithm and counting singular Hankel matrices over a finite field
- scientific article; zbMATH DE number 1498815 (Why is no real title available?)
- scientific article; zbMATH DE number 820495 (Why is no real title available?)
- High-order lifting for polynomial Sylvester matrices
- Computing the characteristic polynomial of generic Toeplitz-like and Hankel-like matrices
- Early termination for sparse interpolation of polynomials in Chebyshev bases
- Faster modular composition
- Encounters in symbolic computation: ideas for the ages
- Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation
This page was built for publication: On the matrix Berlekamp-Massey algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2933664)