scispace - formally typeset
Open AccessJournal ArticleDOI

Primitive normal bases with prescribed trace

TLDR
The existence of an element w in E satisfying the following conditions is proved, which establishes a recent conjecture of Morgan and Mullen, who, by means of a computer search, have verified the existence of such elements for the cases in which q≤ 97 and n≤ 6, n being the degree of E over F.
Abstract
Let E be a finite degree extension over a finite field F = GF(q), G the Galois group of E over F and let a∈F be nonzero. We prove the existence of an element w in E satisfying the following conditions: - w is primitive in E, i.e., w generates the multiplicative group of E (as a module over the ring of integers). - the set {w g ∣g∈G} of conjugates of w under G forms a normal basis of E over F. - the (E, F)-trace of w is equal to a. This result is a strengthening of the primitive normal basis theorem of Lenstra and Schoof [10] and the theorem of Cohen on primitive elements with prescribed trace [3]. It establishes a recent conjecture of Morgan and Mullen [14], who, by means of a computer search, have verified the existence of such elements for the cases in which q≤ 97 and n≤ 6, n being the degree of E over F. Apart from two pairs (F, E) (or (q, n)) we are able to settle the conjecture purely theoretically.

read more

Content maybe subject to copyright    Report






Citations
More filters
Journal ArticleDOI

Explicit theorems on generator polynomials

TL;DR: Progress over the past decade is surveyed concerning explicit existence and construction theorems on irreducible, primitive and normal polynomials.
Journal ArticleDOI

Existence and properties of k-normal elements over finite fields

TL;DR: This paper introduces and characterize k-normal elements, establishes a formula and numerical bounds for the number of k- normal elements and proves an existence result for primitive 1-normal Elements.
Journal ArticleDOI

On the existence of some specific elements in finite fields of characteristic 2

TL;DR: This paper considers the existence of some specific elements in F q n, the finite field with q n elements, and finds an element ξ in Fq n such that ξ is a primitive normal element and ξ + ξ − 1 is a primordial element of FQ n.
Journal ArticleDOI

Variations of the Primitive Normal Basis Theorem

TL;DR: The Primitive Normal Basis Theorem (PNBTH) was shown to be simultaneously primitive and normal over finite fields in this paper, which is known as the primitive normal basis theorem.
Journal ArticleDOI

Normal bases and primitive elements over finite fields

TL;DR: It is shown that, except for an explicit small list of genuine exceptions, for every q, m and A, there exists some primitive [email protected]?F"q"^"m such that both x and (ax+b)/(cx+d) produce a normal basis of F"q".
References
More filters
Book

The Theory of Error-Correcting Codes

TL;DR: This book presents an introduction to BCH Codes and Finite Fields, and methods for Combining Codes, and discusses self-dual Codes and Invariant Theory, as well as nonlinear Codes, Hadamard Matrices, Designs and the Golay Code.
Journal ArticleDOI

Primitive normal bases for finite fields

TL;DR: In this article, it was shown that any finite extension of a finite field has a normal basis consisting of primitive roots, i.e., a basis of the form q~~~~ q 2 qP (aaq aq 2 a9"1) with a E F m.
Journal ArticleDOI

Primitive elements and polynomials with arbitrary trace

TL;DR: It is shown that with one non-trivial exception, GF( qn) contains a primitive element of arbitrary trace over GF(q) that is not part of the classical model.
Journal ArticleDOI

Primitive roots in a finite field

TL;DR: In this article, it was shown that for a prime p, r there are infinitely many irreducible polynomials P such that no polynomial of degree < r can be a primitive root of the second kind (mod P).