Substitutions for linear shift register sequences and the factorization algorithms of Berlekamp and Niederreiter

DOI10.1016/0024-3795(95)00358-4zbMath0861.68058OpenAlexW2081910900MaRDI QIDQ2564910

Ehler Lange

Publication date: 11 May 1997

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(95)00358-4

zbMATH Keywords

finite automatasubstitutionsfactorization algorithms

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Parallel algorithms in computer science (68W10)

Cites Work

• Unnamed Item
• Unnamed Item
• Connections between the algorithms of Berlekamp and Niederreiter for factoring polynomials over \(\mathbb{F}_ q\)
• Factorization of polynomials and some linear-algebra problems over finite fields
• Factorization of polynomials over finite fields and characteristic sequences
• Suites algébriques, automates et substitutions
• Factoring Polynomials over Finite Fields Using Differential Equations and Normal Bases
• On finite projective planes in Lenz-Barlotti class at least I.3
• RESCALED EVOLUTION SETS OF LINEAR CELLULAR AUTOMATA ON A CYLINDER
• An Efficient Formula for Linear Recurrences

This page was built for publication: Substitutions for linear shift register sequences and the factorization algorithms of Berlekamp and Niederreiter