Recurrent methods for constructing irreducible polynomials over \(\mathbb F_q\) of odd characteristics. II

DOI10.1016/j.ffa.2005.07.002zbMath1165.11343OpenAlexW2082533271MaRDI QIDQ2500603

Melsik K. Kyureghyan

Publication date: 17 August 2006

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2005.07.002

zbMATH Keywords

finite fieldminimal polynomialsirreducible polynomialsrecurrent methodcompletely normal elementnormal polynomialsodd characteristicsproper element

Mathematics Subject Classification ID

Polynomials over finite fields (11T06)

Related Items (8)

A recurrent construction of irreducible polynomials of fixed degree over finite fields ⋮ Irreducible compositions of polynomials over finite fields of even characteristic ⋮ Constructing irreducible polynomials recursively with a reverse composition method ⋮ Recursive constructions of irreducible polynomials over finite fields ⋮ Irreducible compositions of polynomials over finite fields ⋮ FACTORIZATION OF SOME COMPOSITE POLYNOMIALS OVER FINITE FIELDS ⋮ Modular composition via factorization ⋮ Sequences of irreducible polynomials without prescribed coefficients over odd prime fields

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 \(\mathbb F_{q}\) of odd characteristics.
• Explicit N-polynomials of \(2\)-power degree over finite fields. I
• Unnamed Item

This page was built for publication: Recurrent methods for constructing irreducible polynomials over \(\mathbb F_q\) of odd characteristics. II