A generalization of the primitive normal basis theorem
Let \(A=\mathbb F_q[T]\) and fix irreducible \(f\in A\) of degree \(d\). Set \(E_m=\mathbb F_{q^{dm}}\). One can define an \(A\)-module structure on \(E_m\) resulting in the Carlitz module \(C(E_m)\). \(C(E_m)\) is isomorphic, as an \(A\)-module, to \(A/(f^m-1)\) and so is cyclic. A primitive generator for \(C(E_m)\) is a primitive element \(\alpha\in E_m\) that generates \(C(E_m)\). The authors prove that \(C(E_m)\) has a primitive generator except possibly for finitely many \((q, d, m)\), which are given explicitly. They note there is no primitive generator for \((q,d,m)=(2,2,1)\). When \(f=T\), a primitive generator of \(C(E_m)\) yields a primitive normal basis for \(E_m\) over \(E_1\). Lenstra and Schoof have shown that primitive normal bases exist in all cases.
- Bases for Finite Fields
- scientific article; zbMATH DE number 940594 (Why is no real title available?)
- scientific article; zbMATH DE number 3075874 (Why is no real title available?)
- Primitive Normal Bases for Finite Fields
- Primitive Roots in a Finite Field
- THE PRIMITIVE NORMAL BASIS THEOREM – WITHOUT A COMPUTER
- The finite basis theorem for relatively normal lattices
- On the existence of primitive completely normal bases of finite fields
- An extension of the (strong) primitive normal basis theorem
- Further results on the Morgan-Mullen conjecture
- Variations of the primitive normal basis theorem
- A normal form supplement to the Oettli-Prager theorem
- Normal bases and primitive elements over finite fields
- scientific article; zbMATH DE number 3883944 (Why is no real title available?)
- A unified version of the primitive and normal basis theorems
- THE PRIMITIVE NORMAL BASIS THEOREM – WITHOUT A COMPUTER
- On Orders of Optimal Normal Basis Generators
- A search for c-Wieferich primes
This page was built for publication: A generalization of the primitive normal basis theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q607047)
