Today we will discuss particularly nice irreducible polynomials called primitive polynomials, whose roots are primitive elements. These are ideal for constructing finite fields, and their properties will be very useful in studying our next class of codes.
Before our class meeting, you should use the resources below to be able to learn the following. You should be reasonably fluent with these; weβll answer some questions on them in class but not reteach them in detail.
The exponent or order of a polynomial \(a(x)\in F[x]\) with \(\gcd(a(x),x)=1\) is the smallest positive integer \(e\) such that \(a(x)\mid x^e-1\text{,}\) denoted \(\exp(a(x))\text{.}\)
Proposition64.The Exponent of an Irreducible is the Order of its Roots.
Let \(a(x)\in F[x]\) be an irreducible polynomial which is not a constant multiple of \(x\text{.}\) Then \(\exp(a(x))\) is the order of any root of \(a(x)\) in an extension field of \(F\text{.}\)
Proposition65.Relation between Order of Root and Minimum Polynomial Degree.
Let \(\alpha\neq 0\) have order \(e\) in an extension field of \(F\text{.}\) Then the degree of the minimum polynomial of \(\alpha\) over \(F\) is the smallest positive integer \(m\) such that \(e\mid q^m-1\text{.}\)