English

Normal bases and irreducible polynomials

Number Theory 2018-07-27 v1

Abstract

Let Fq\mathbb{F}_q denote the finite field of qq elements and Fqn\mathbb{F}_{q^n} the degree nn extension of Fq\mathbb{F}_q. A normal basis of Fqn\mathbb{F}_{q^n} over Fq\mathbb{F} _q is a basis of the form {α,αq,,αqn1}\{\alpha,\alpha^q,\dots,\alpha^{q^{n-1}}\}. An irreducible polynomial in Fq[x]\mathbb{F} _q[x] is called an NN-polynomial if its roots are linearly independent over Fq\mathbb{F} _q. Let pp be the characteristic of Fq\mathbb{F} _q. Pelis et al. showed that every monic irreducible polynomial with degree nn and nonzero trace is an NN-polynomial provided that nn is either a power of pp or a prime different from pp and qq is a primitive root modulo nn. Chang et al. proved that the converse is also true. By comparing the number of NN-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.

Keywords

Cite

@article{arxiv.1807.09927,
  title  = {Normal bases and irreducible polynomials},
  author = {Hua Huang and Shanmeng Han and Wei Cao},
  journal= {arXiv preprint arXiv:1807.09927},
  year   = {2018}
}

Comments

This is my first submission to arxiv. Just a try!

R2 v1 2026-06-23T03:14:49.690Z