Papers
Topics
Authors
Recent
Search
2000 character limit reached

Normal bases and irreducible polynomials

Published 26 Jul 2018 in math.NT | (1807.09927v1)

Abstract: Let $\mathbb{F}q$ denote the finite field of $q$ elements and $\mathbb{F}{qn}$ the degree $n$ extension of $\mathbb{F}q$. A normal basis of $\mathbb{F}{qn}$ over $\mathbb{F} _q$ is a basis of the form ${\alpha,\alphaq,\dots,\alpha{q{n-1}}}$. An irreducible polynomial in $\mathbb{F} _q[x]$ is called an $N$-polynomial if its roots are linearly independent over $\mathbb{F} _q$. Let $p$ be the characteristic of $\mathbb{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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (3)

Collections

Sign up for free to add this paper to one or more collections.