Normal bases and irreducible polynomials
Abstract
Let Fq denote the finite field of q elements and Fqn the degree n extension of Fq. A normal basis of Fqn over F q is a basis of the form \α,αq,…,αqn-1\. An irreducible polynomial in F q[x] is called an N-polynomial if its roots are linearly independent over F q. Let p be the characteristic of F q. Pelis et al. showed that every monic irreducible polynomial with degree n and nonzero trace is an N-polynomial provided that n is either a power of p or a prime different from p and q is a primitive root modulo n. Chang et al. proved that the converse is also true. By comparing the number of N-polynomials with that of irreducible polynomials with nonzero traces, we present an alternative treatment to this problem and show that all the results mentioned above can be easily deduced from our main theorem.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.