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
Quasirandom points and global function fields
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. We present a survey of recent work of the authors in which sequences of quasirandom points are constructed by new methods based on global function fields. These methods yield significant improvements on all earlier constructions. The most powerful of these methods employ global function fields with many rational places, or equivalently algebraic curves over finite fields with many rational points. With the help of class field theory for global function fields, it can be shown that our constructions are best possible in the sense of the order of magnitude of quality parameters. The paper contains also a new construction of sequences of quasirandom points and new facts about the earlier constructions designed by the authors.
Introduction
The motivation for the work that we want to present here stems from the theory of uniform distribution of sequences in number theory and from quasi-Monte Carlo methods in numerical analysis. A key problem in these areas is how to distribute points as uniformly as possible over an s-dimensional unit cube Is = [0, 1]s, s ≥ 1. A precise formulation of this problem will be given below. The essence of our work is that methods based on global function fields (or, equivalently, on algebraic curves over finite fields) yield excellent constructions of (finite) point sets and (infinite) sequences with strong uniformity properties. In fact, these methods are so powerful that they lead to constructions which are, in a sense to be explained later, best possible.
- Type
- Chapter
- Information
- Finite Fields and ApplicationsProceedings of the Third International Conference, Glasgow, July 1995, pp. 269 - 296Publisher: Cambridge University PressPrint publication year: 1996
- 32
- Cited by