The black-box Niederreiter algorithm and its implementation over the binary field
From MaRDI portal
Publication:4417166
DOI10.1090/S0025-5718-03-01494-7zbMath1113.11073OpenAlexW2142472463MaRDI QIDQ4417166
Peter Roelse, Markus Chr. Holder, Peter Fleischmann
Publication date: 28 July 2003
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-03-01494-7
Related Items (2)
A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over \(\mathbb F_2\) ⋮ A note on the factorization method of Niederreiter
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On arithmetical algorithms over finite fields
- Applied algebra, algebraic algorithms and error-correcting codes. 9th international symposium, AAECC '9, New Orleans, LA, USA, October 7-11, 1991. Proceedings
- Connections between the algorithms of Berlekamp and Niederreiter for factoring polynomials over \(\mathbb{F}_ q\)
- Factorization of polynomials over finite fields and characteristic sequences
- A new efficient factorization algorithm for polynomials over small finite fields
- Solving sparse linear equations over finite fields
- A New Algorithm for Factoring Polynomials Over Finite Fields
- Factoring high-degree polynomials over $\mathbf F_2$ with Niederreiter's algorithm on the IBM SP2
- Subquadratic-time factoring of polynomials over finite fields
- Shift-register synthesis and BCH decoding
This page was built for publication: The black-box Niederreiter algorithm and its implementation over the binary field
