Pages that link to "Item:Q1311315"

The following pages link to Connections between the algorithms of Berlekamp and Niederreiter for factoring polynomials over \(\mathbb{F}_ q\) (Q1311315):

Displaying 8 items.

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