A note on N-polynomials over finite fields
From MaRDI portal
Publication:5152010
DOI10.11568/KJM.2020.28.3.639zbMATH Open1482.11156OpenAlexW3093132091MaRDI QIDQ5152010FDOQ5152010
Authors: Kitae Kim, Ikkwon Yie 
Publication date: 18 February 2021
Full work available at URL: http://journal.kkms.org/index.php/kjm/article/download/999/564
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
Polynomials over finite fields (11T06) Finite fields (field-theoretic aspects) (12E20) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30) Special polynomials in general fields (12E10)
Cites Work
- On the construction of irreducible self-reciprocal polynomials over finite fields
- Normal bases of cyclic fields of primepower degree
- Self-Complementary Normal Bases in Finite Fields
- On the reducibility of some composite polynomials over finite fields
- Iterated constructions of irreducible polynomials over finite fields with linearly independent roots
- Normal basis of finite field<tex>GF(2^m)</tex>(Corresp.)
- Factorization of a class of polynomials over finite fields
- Recurrent methods for constructing irreducible polynomials over \(\text{GF}(2^s)\)
- Trace-orthogonal normal bases
- Title not available (Why is that?)
- Groups of permutations generated by function-linear translator pairs
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)
