Irreducible compositions of polynomials over finite fields

DOI10.1007/s10623-010-9478-5zbMath1248.11098arXiv1008.1863MaRDI QIDQ648074

Gohar M. Kyureghyan, Melsik K. Kyureghyan

Publication date: 22 November 2011

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1008.1863

zbMATH Keywords

finite field; polynomial composition; irreducible polynomial; explicit family; set of coefficients

Mathematics Subject Classification ID

11T06: Polynomials over finite fields

Related Items

FACTORIZATION OF SOME COMPOSITE POLYNOMIALS OVER FINITE FIELDS, On the reducibility of some composite polynomials over finite fields, Recursive constructions of irreducible polynomials over finite fields, Composed products and factors of cyclotomic polynomials over finite fields, A note on composed products of polynomials over finite fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Iterated constructions of irreducible polynomials over finite fields with linearly independent roots
• 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
• Recurrent methods for constructing irreducible polynomials over \(\mathbb F_q\) of odd characteristics. II
• Explicit theorems on generator polynomials
• Linear Recurring Sequences
• ON NORMAL BASES OF A FINITE FIELD
• On irreducible polynomials of certain types in finite fields