The explicit construction of irreducible polynomials over finite fields
Designs, Codes and Cryptography
Explicit N-polynomials of 2-power degree over finite fields, I.
Designs, Codes and Cryptography
Recurrent methods for constructing irreducible polynomials over Fq of odd characteristics, II
Finite Fields and Their Applications
Completely Normal Elements in Iterated Quadratic Extensions of Finite Fields
Finite Fields and Their Applications
Recurrent methods for constructing irreducible polynomials over Fq of odd characteristics
Finite Fields and Their Applications
Iterated constructions of irreducible polynomials over finite fields with linearly independent roots
Finite Fields and Their Applications
Explicit theorems on generator polynomials
Finite Fields and Their Applications
A recurrent method for constructing irreducible polynomials over finite fields
CASC'11 Proceedings of the 13th international conference on Computer algebra in scientific computing
On the reducibility of some composite polynomials over finite fields
Designs, Codes and Cryptography
Composed products and factors of cyclotomic polynomials over finite fields
Designs, Codes and Cryptography
| Hi-index | 0.00 |
The paper is devoted to the composition method of constructing families of irreducible polynomials over finite fields.