scientific article; zbMATH DE number 1303020
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].
- Character sum constructions of constrained error-correcting codes
- Incomplete sums, DC-constrained codes, and codes that maintain synchronization
- scientific article; zbMATH DE number 1284426
- Incomplete character sums over finite fields and their application to the interpolation of the discrete logarithm by Boolean functions
- Topics related to character sums
- scientific article; zbMATH DE number 4085776
- Sufficient conditions for good and proper error-detecting codes
- Statistical Decoding of Codes over $\mathbb{F}_q$
- A New Algorithm for Factoring Polynomials Over Finite Fields
- scientific article; zbMATH DE number 227441
- Some exponent pairs by Vinogradov's method
- Family complexity and cross-correlation measure for families of binary sequences
- scientific article; zbMATH DE number 3875369 (Why is no real title available?)
- scientific article; zbMATH DE number 96231 (Why is no real title available?)
- scientific article; zbMATH DE number 1984322 (Why is no real title available?)
- scientific article; zbMATH DE number 2124248 (Why is no real title available?)
- scientific article; zbMATH DE number 3057473 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249519)