No label defined (Q4249519)
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 1303020
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1303020 |
Statements
12 September 1999
0 references
Vinogradov's method
0 references
character sums
0 references
solutions of polynomial equations over finite fields
0 references
discrete Fourier transform
0 references
partial-period correlations of linear codes
0 references
survey
0 references
0.7534435
0 references
0.7194012
0 references
0.7041892
0 references
0 references
0.6802632
0 references
0.67548966
0 references
0.6661455
0 references
The paper provides an excellent survey on Vinogradov's classical method of estimating incomplete character sums over finite fields. Vinogradov's fundamental idea was to use the discrete Fourier transform in order to estimate an incomplete character sum by means of complete but possibly more complicated sums. Results obtained in this way were applied by Vinogradov to the problem of the distribution of primitive roots and residues or nonresidues of a polynomial modulo a prime number. In a series of papers of \textit{L. J. Mordell} [Arch. Math. 8, 153-157 (1957; Zbl 0079.06306)], \textit{D. A. Burgess} [Proc. Lond. Math. Soc. 12, 179-192 (1962; Zbl 0106.04003)], \textit{G. Myerson} [Mathematika 28, 153-159 (1981; Zbl 0469.10002)] and others the Vinogradov method was essentially modified in order to show that if \(\mathbb{F}_{q}\) is a finite field with \(q\) elements then every box \(B\) in \(\mathbb{F}_{q}^{n}\) which is not very small with respect to \(\mathbb{F}_{q}^{n}\) contains at least one solution of a system of polynomial equations \[ f_{1}(x_{1}, \ldots ,x_{n})= \cdots = f_{s}(x_{1}, \ldots ,x_{n})=0 \] over \(\mathbb{F}_{q}\). The author presents all these results from a unique point of view and in a very elementary way. Moreover the author demonstrates some applications of Vinogradov's method to the problem of correlation properties of linear codes. For many classes of binary linear codes the full-periodic correlation can be estimated by means of complete character sums. On the other hand, the estimation of the partial-period correlation is reduced to the estimation of the corresponding incomplete character sums. Making use of Vinogradov's method, the author finds nontrivial upper bounds for the partial-period correlation of the Kasami binary codes and the codes which are dual to some binary BCH-codes. For the entire collection see [Zbl 0905.00051].
0 references