On the matrix berlekamp-massey algorithm

DOI10.1145/2500122zbMath1301.65030OpenAlexW2010027455WikidataQ57425799 ScholiaQ57425799MaRDI QIDQ2933664

Erich L. Kaltofen, George Yuhasz

Publication date: 5 December 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2500122

zbMATH Keywords

matrix polynomialsminimal generatorslinear generated sequencesmultivariable linear controlvector Berlekamp/Massey algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Related Items

Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences, In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: the adaptive variants, On the Berlekamp/Massey algorithm and counting singular Hankel matrices over a finite field, Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation, High-order lifting for polynomial Sylvester matrices, A fraction free matrix Berlekamp/Massey algorithm, Linear feedback shift registers and the minimal realization problem, Probabilistic analysis of block Wiedemann for leading invariant factors