z-logo
open-access-imgOpen Access
On the Density of Normal Bases in Finite Fields
Author(s) -
Gudmund Skovbjerg Frandsen
Publication year - 1997
Publication title -
brics report series
Language(s) - English
Resource type - Journals
eISSN - 1601-5355
pISSN - 0909-0878
DOI - 10.7146/brics.v4i44.18970
Subject(s) - combinatorics , finite field , mathematics , vector space , space (punctuation) , normal basis , physics , discrete mathematics , geometry , philosophy , linguistics , galois theory
Let Fqn denote the finite field with q^n elements, for q being a prime power. Fqn may be regarded as an n-dimensional vector space over Fq. alpha in Fqn generates a normal basis for this vector space (Fqn : Fq), if {alpha, alpha^q, alpha^q^2 , . . . , alpha^q^(n−1)} are linearly independent over Fq. Let N(q; n) denote the number of elements in Fqn that generate a normal basis for Fqn : Fq, and let nu(q, n) = N(q,n)/q^n denote the frequency of such elements. We show that there exists a constant c > 0 such that nu(q, n) >= c / sqrt(log _q n) ,for all n, q >= 2 and this is optimal up to a constant factor in that we show 0.28477 = 2 We also obtain an explicit lower bound: nu(q, n) >= 1 / e [log_q n], for all n, q >= 2

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom