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
Preface
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
This volume represents the refereed proceedings of the Third International Conference on Finite Fields and Applications held at the University of Glasgow, Scotland, 11–14 July, 1995, where it was hosted by the Department of Mathematics. The conference, often referred to as Fq3, was the successor of two other international conferences concerning finite fields held at the University of Nevada, Las Vegas, USA, in August 1991 and in August 1993. The Organising Committee comprised Steve Cohen, Stuart Hoggar, Bob Odoni (all of the University of Glasgow), James Hirschfeld (University of Sussex), Gary Mullen (Pennsylvania State University), Harald Niederreiter (Austrian Academy of Sciences) and Peter Shiue (University of Nevada, Las Vegas).
Finite fields with their tight structure are intrinsically fascinating; further, their study is now recognised to be extremely useful in diverse areas of pure and applicable mathematics, including aspects of number theory, algebra, analysis and algebraic geometry and, at the same time, manifold aspects of information theory, computer science and engineering. For example, coding theory is enriched by deep ideas, crucially involving finite fields, on exponential sums, function fields and linear algebra, and in turn, has stimulated further questions for finite field research. Indeed, what is particularly exciting in current activity is the interplay between various areas, within pure mathematics itself and within those having definite applications. A further sign of this vitality is the emergence in 1995 of the journal Finite Fields and Their Applications published by Academic Press.
- Type
- Chapter
- Information
- Finite Fields and ApplicationsProceedings of the Third International Conference, Glasgow, July 1995, pp. vii - viiiPublisher: Cambridge University PressPrint publication year: 1996