A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over \(\mathbb F_2\) (Q2492665)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over \(\mathbb F_2\) |
scientific article |
Statements
A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over \(\mathbb F_2\) (English)
0 references
14 June 2006
0 references
In Niederreiter's algorithm the polynomial factorization problem over \(\mathbb F_2\) is reduced to the problem of solving a certain linear equation system. Here the authors investigate the special case of factoring trinomials over \(\mathbb F_2\). They develop a new algorithm for solving the linear equation system using sparse Gaussian elimination with the Markowitz ordering strategy.
0 references
polynomial factorization
0 references
finite fields
0 references
Niederreiter's algorithm
0 references
sparse linear equation systems
0 references
0 references
0 references
