Coding-theoretical methods are used to obtain improved lower bounds for character sums induced by a multiplicative character of an arbitrary order over GF(q).
A note on character sums
โ Scribed by R.J. Cook
- Publisher
- Elsevier Science
- Year
- 1979
- Tongue
- English
- Weight
- 401 KB
- Volume
- 11
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Let f be a complex-valued function on a finite field F such that f(0)=0, f(1)=1, and |f(x)|=1 for x ] 0. H. Cohn asked if it follows that f is a nontrivial multiplicative character provided that ; x ยฅ F f(x) f(x+h)=-1 for h ] 0. We prove that this is the case for finite fields of prime cardinality u
Cohn's problem on character sums (see , p. 202) asks whether a multiplicative character on a finite field can be characterized by a kind of two level autocorrelation property. Let f be a map from a finite field F to the complex plane such that f (0)=0, f (1)=1, and | f (:)| =1 for all :{0. In this p