Recursive constructions of N-polynomials over \(\text{GF}(2^s)\)
From MaRDI portal
Publication:947101
DOI10.1016/j.dam.2006.11.014zbMath1179.11045OpenAlexW1976720753MaRDI QIDQ947101
Publication date: 29 September 2008
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2006.11.014
iterative methodQ-transformationtrace-compatible sequencesconstructive theory of normal polynomialsGalois fields of characteristic 2irreducible polynomials over GF(q)normal basis over GF(q)
Related Items (2)
Recursive construction of normal polynomials over finite fields ⋮ Some relations between the irreducible polynomials over a finite field and its quadratic extension
Cites Work
- The explicit construction of irreducible polynomials over finite fields
- Completely normal elements in iterated quadratic extensions of finite fields
- Recurrent methods for constructing irreducible polynomials over \(\text{GF}(2^s)\)
- Explicit N-polynomials of \(2\)-power degree over finite fields. I
- Finding Isomorphisms Between Finite Fields
- CONSTRUCTION OF POLYNOMIALS IRREDUCIBLE OVER A FINITE FIELD WITH LINEARLY INDEPENDENT ROOTS
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Recursive constructions of N-polynomials over \(\text{GF}(2^s)\)