Connections between the algorithms of Berlekamp and Niederreiter for factoring polynomials over \(\mathbb{F}_ q\)

DOI10.1016/0024-3795(93)90238-JzbMath0845.11041MaRDI QIDQ1311315

Peter Fleischmann

Publication date: 30 January 1994

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

zbMATH Keywords

algorithmsfactoring polynomialspolynomials over finite fieldsBerlekamp methodNiederreiter method

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06) Factorization (11Y05)

Related Items (8)

Univariate polynomial factorization over finite fields ⋮ Improving the algorithms of Berlekamp and Niederreiter for factoring polynomials over finite fields ⋮ Factoring polynomials over finite fields: A survey ⋮ Subquadratic-time factoring of polynomials over finite fields ⋮ A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over \(\mathbb F_2\) ⋮ The black-box Niederreiter algorithm and its implementation over the binary field ⋮ On a New Factorization Algorithm for Polynomials Over Finite Fields ⋮ Substitutions for linear shift register sequences and the factorization algorithms of Berlekamp and Niederreiter

Cites Work

• Factorization of polynomials and some linear-algebra problems over finite fields
• A new efficient factorization algorithm for polynomials over small finite fields
• A New Algorithm for Factoring Polynomials Over Finite Fields
• Unnamed Item

This page was built for publication: Connections between the algorithms of Berlekamp and Niederreiter for factoring polynomials over \(\mathbb{F}_ q\)