On the Berlekamp/Massey algorithm and counting singular Hankel matrices over a finite field

DOI10.1016/j.jsc.2011.09.008zbMath1242.65074OpenAlexW2127637106WikidataQ57432132 ScholiaQ57432132MaRDI QIDQ412213

Matthew T. Comer, Erich L. Kaltofen

Publication date: 4 May 2012

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2011.09.008

zbMATH Keywords

finite fieldToeplitz matrixHankel matrixBerlekamp/Massey algorithmsingularity counts

Mathematics Subject Classification ID

Matrices over special rings (quaternions, finite fields, etc.) (15B33) Toeplitz, Cauchy, and related matrices (15B05)

Related Items

On determinantal varieties of Hankel matrices

Cites Work

• Unnamed Item
• Early termination in sparse interpolation algorithms
• Relatively prime polynomials and nonsingular Hankel matrices over finite fields
• On the complexity of circuit satisfiability
• On the matrix berlekamp-massey algorithm
• Distribution of Bordered Persymmetric Matrices in a Finite Field.
• A method for solving key equation for decoding goppa codes
• Shift-register synthesis and BCH decoding

This page was built for publication: On the Berlekamp/Massey algorithm and counting singular Hankel matrices over a finite field