Cohen and McNay both give iterative constructions of irreducible polynomials of 2-power degree over finite fields of odd order. In this paper I show that the roots of these polynomials are completely normal elements in the appropriate extension field.
Normal Bases and Completely Free Elements in Prime Power Extensions over Finite Fields
β Scribed by Dirk Hachenberger
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 253 KB
- Volume
- 2
- Category
- Article
- ISSN
- 1071-5797
No coin nor oath required. For personal study only.
β¦ Synopsis
We continue the work of the previous paper (Hachenberger, Finite Fields Appl., in press), and, generalizing some of the results obtained there, we give explicit constructions of free and completely free elements in GF(q r n ) over GF(q), where n is any nonnegative integer and where r is any odd prime number which does not divide the characteristic of GF(q) or where r Ο 2 and q Ο΅ 1 mod 4. Together with results on the case where r Ο 2 and q Ο΅ 3 mod 4 obtained in the previous paper and results on the well-known case where r is equal to the characteristic of GF(q), we are able to explicitly determine free and completely free elements in GF(q m ) over GF(q) for every nonnegative integer m and every prime power q.
π SIMILAR VOLUMES
A characterization of normal bases and complete normal bases in GF(q r n ) over GF(q), where q ΟΎ 1 is any prime power, r is any prime number different from the characteristic of GF(q), and n Υ 1 is any integer, leads to a general construction scheme of series (v n ) nΥ0 in GF(q r Θ ) :Ο Κ nΥ0 GF(q r