A note on N-polynomials over finite fields
From MaRDI portal
Publication:5152010
Recommendations
- Recursive constructions of \(k\)-normal polynomials using some rational transformations over finite fields
- Explicit N-polynomials of \(2\)-power degree over finite fields. I
- Normal bases and irreducible polynomials
- Iterated constructions of completely normal polynomials
- scientific article; zbMATH DE number 691486
Cites work
- scientific article; zbMATH DE number 4097511 (Why is no real title available?)
- Factorization of a class of polynomials over finite fields
- Groups of permutations generated by function-linear translator pairs
- Iterated constructions of irreducible polynomials over finite fields with linearly independent roots
- Normal bases of cyclic fields of primepower degree
- Normal basis of finite field<tex>GF(2^m)</tex>(Corresp.)
- On the construction of irreducible self-reciprocal polynomials over finite fields
- On the reducibility of some composite polynomials over finite fields
- Recurrent methods for constructing irreducible polynomials over \(\text{GF}(2^s)\)
- Self-Complementary Normal Bases in Finite Fields
- Trace-orthogonal normal bases
Cited in
(4)
This page was built for publication: A note on \(N\)-polynomials over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5152010)