Explicit N-polynomials of \(2\)-power degree over finite fields. I

DOI10.1007/BF01398009zbMath0834.11053MaRDI QIDQ1894274

Helmut Meyn

Publication date: 31 March 1996

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

zbMATH Keywords

finite fieldsnormal polynomialsrelative tracetrace-compatible

Mathematics Subject Classification ID

Polynomials over finite fields (11T06)

Related Items (10)

Recursive construction of normal polynomials over finite fields ⋮ Iterated constructions of irreducible polynomials over finite fields with linearly independent roots ⋮ Irreducible compositions of polynomials over finite fields of even characteristic ⋮ High order elements in finite fields arising from recursive towers ⋮ Constructing irreducible polynomials recursively with a reverse composition method ⋮ Irreducible compositions of polynomials over finite fields ⋮ Recursive constructions of N-polynomials over \(\text{GF}(2^s)\) ⋮ Recurrent methods for constructing irreducible polynomials over \(\mathbb F_q\) of odd characteristics. II ⋮ Completely normal elements in iterated quadratic extensions of finite fields ⋮ Explicit theorems on generator polynomials

Cites Work

• Specific irreducible polynomials with linearly independent roots over finite fields
• The explicit construction of irreducible polynomials over finite fields
• Trace- and norm-compatible extensions of finite fields
• On the construction of irreducible self-reciprocal polynomials over finite fields
• CONSTRUCTION OF POLYNOMIALS IRREDUCIBLE OVER A FINITE FIELD WITH LINEARLY INDEPENDENT ROOTS
• Infinite Algebraic Extensions of Finite Fields
• Primitive Normal Bases for Finite Fields
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Explicit N-polynomials of \(2\)-power degree over finite fields. I