On character sums and codes (Q1075358)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3950632
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On character sums and codes |
scientific article; zbMATH DE number 3950632 |
Statements
On character sums and codes (English)
0 references
1985
0 references
Coding-theoretical methods are used to obtain improved lower bounds for the function \(S(d,r,q)=\max | \sum_{\alpha \in F}\chi (f(\alpha))|\) where \(\chi\) is a multiplicative character of order d over a finite field F of q elements and the maximum is taken over all polynomials f(x)\(\in F[x]\) which are not d-th powers and have exactly r distinct zeros in the splitting field.
0 references
lower bounds for character sums
0 references
Coding-theoretical methods
0 references
multiplicative character
0 references
finite field
0 references
0.8339393734931946
0 references
