
Book contents
- Frontmatter
- Contents
- Preface
- Conference Participants
- Factorizations over finite fields
- Class number in totally imaginary extensions of totally real function fields
- Automorphism groups and permutation groups of affine-invariant codes
- A construction of bent functions
- Monodromy groups of classical families over finite fields
- Wan's bound for value sets of polynomials
- Comparative implementations of Berlekamp's and Niederreitor's polynomial factorization algorithms
- On the minimal polynomials for certain Gauss periods over finite fields
- Completely free elements
- Exponential sums over Galois rings and their applications
- Maximal sets of mutually orthogonal Latin squares
- Examples of small hybrid sums
- Cellular automata, substitutions and factorization of polynomials over finite fields
- A new class of two weight codes
- Construction of digital (t, m, s)-nets from linear codes
- A family of exceptional polynomials in characteristic three
- Estimates of character sums arising from finite upper half planes
- Carmichael-Carlitz polynomials and Fermat-Carlitz quotients
- Open problems and conjectures in finite fields
- Quasirandom points and global function fields
- Use characteristic sets to decode cyclic codes up to actual minimum distance
- Approximate constructions in finite fields
- Periodicity properties of kth order linear recurrences whose characteristic polynomial splits completely over a finite field, II
- Factoring cyclotomic polynomials over large finite fields
- Character sums and coding theory
- L-functions of algebraic varieties over finite fields: rationality, meromorphy and entireness
- Some congruences and identities for generalizations of Rédei functions
Completely free elements
Published online by Cambridge University Press: 29 September 2009
- Frontmatter
- Contents
- Preface
- Conference Participants
- Factorizations over finite fields
- Class number in totally imaginary extensions of totally real function fields
- Automorphism groups and permutation groups of affine-invariant codes
- A construction of bent functions
- Monodromy groups of classical families over finite fields
- Wan's bound for value sets of polynomials
- Comparative implementations of Berlekamp's and Niederreitor's polynomial factorization algorithms
- On the minimal polynomials for certain Gauss periods over finite fields
- Completely free elements
- Exponential sums over Galois rings and their applications
- Maximal sets of mutually orthogonal Latin squares
- Examples of small hybrid sums
- Cellular automata, substitutions and factorization of polynomials over finite fields
- A new class of two weight codes
- Construction of digital (t, m, s)-nets from linear codes
- A family of exceptional polynomials in characteristic three
- Estimates of character sums arising from finite upper half planes
- Carmichael-Carlitz polynomials and Fermat-Carlitz quotients
- Open problems and conjectures in finite fields
- Quasirandom points and global function fields
- Use characteristic sets to decode cyclic codes up to actual minimum distance
- Approximate constructions in finite fields
- Periodicity properties of kth order linear recurrences whose characteristic polynomial splits completely over a finite field, II
- Factoring cyclotomic polynomials over large finite fields
- Character sums and coding theory
- L-functions of algebraic varieties over finite fields: rationality, meromorphy and entireness
- Some congruences and identities for generalizations of Rédei functions
Summary
Abstract. This paper is a working out of the same-titled talk given by the author at the Third International Conference on Finite Fields and Their Applications in Glasgow, 1995. We give a survey on recent results on the characterization, the structure, the enumeration, and the construction of completely free elements and normal bases in finite dimensional extensions over finite fields.
A Strengthening of the Normal Basis Theorem. If E is a finite dimensional Galois extension over a field F with Galois group G, then the Normal Basis Theorem states that the additive group (E, +) of E is a cyclic module over the group algebra FG, i.e., there exists an element w in E such that the set {g(w) | g ∈ G} of G-conjugates of w is an F-basis of E. Such a basis is called a normal basis in E over F. Every generator w of E as FG-module is called a normal basis generator in E over F. For the sake of simplicity such an element is also called free in E over F.
If H is a subgroup of G, and Fix(H) is the intermediate field of E over F belonging to H via the Galois correspondence, i.e., the subfield of E which is fixed elementwise by H, then (E, +) likewise carries the structure of a Fix(H) H-module.
- Type
- Chapter
- Information
- Finite Fields and ApplicationsProceedings of the Third International Conference, Glasgow, July 1995, pp. 97 - 108Publisher: Cambridge University PressPrint publication year: 1996