Lower bound for certain binary exponential sums
[For the entire collection see Zbl 0745.00062.] The Riemann hypothesis on curves over finite fields yields that the weights \(w\) of the words in the dual of the primitive binary BCH code of length \(2^ m-1\) and designed distance \(\delta=2t+1\) satisfy the inequality \[ | w-2^{m-1}|\leq (t-1)2^{m/2}. \] In [\textit{F. J. MacWilliams} and \textit{N. J. A. Sloane}, The theory of error-correcting codes (North-Holland, 1977; Zbl 0369.94008)] the problem is posed whether the stronger inequality \[ | w-2^{m-1}|\leq(t- 1)2^{[m/2]}\tag{1} \] holds. This is correct for \(\delta=3,5,7\). The author [IEEE Trans. Inf. Theory 38, 478-479 (1992; Zbl 0744.94017)] proved that (1) is not true for \(\delta=9\). In this paper the author proves more general that (1) is not correct for \(\delta=k+2\), where \(k\) is a prime such that 2 generates the squares modulo \(k\). The proof is based on the fact that the curve \(\mathcal C\) with affine equation \(y^ 2+y=x^ k\) corresponds to a word \(c\) in the dual of the BCH code with designed distance \(\delta=k+2\). The exponential sum \(S_ m=\sum_{x\in\mathbb{F}_{2^ m}}(-1)^{\text{Tr}(x^ k)}\), where Tr denotes the trace map from \(\mathbb{F}_{2^ m}\) to \(\mathbb{F}_ 2\), is connected to the weight \(w_ c\) of \(c\) via \(S_ m=2^ m-2w_ c\) and \(S_ m=N_ m-2^ m-1\), with \(N_ m\) the number of \(\mathbb{F}_{2^ m}\)- rational points on \(\mathcal C\). The author derives that the characteristic polynomial of Frobenius over \(\mathbb{F}_ 2\) for \(\mathcal C\) has a relatively simple form. This yields \[ \limsup_{\text{odd }m\to\infty}(| S_ m|/2^{m/2})=k-1, \] which implies the invalidity of the conjectured inequality for infinitely many values of odd \(m\). Finally the author shows that under the generalized Riemann hypothesis there exist infinitely many primes \(k\) with the above mentioned property.
- Lower bounds of exponential sums
- A lower bound for restricted exponential sums
- scientific article; zbMATH DE number 1009717
- On the lower bound of the divisibility of exponential sums in binomial case
- Bounds for certain exponential sums
- Bounds for exponential sums
- scientific article; zbMATH DE number 903691
- Explicit bounds on monomial and binomial exponential sums
- Bounds for exponential sums over finite fields
- Weight of duals of BCH codes and exponential sums
- Asymptotic estimation of the minimum distance of the duals of BCH codes and Dickson polynomials
- Near-primitive roots
- Poids des duaux des codes BCH de distance prescrite 2a+1 et sommes exponentielles
- scientific article; zbMATH DE number 1009717 (Why is no real title available?)
- scientific article; zbMATH DE number 1472122 (Why is no real title available?)
- Binary refinement implies discrete exponentiation
This page was built for publication: Lower bound for certain binary exponential sums
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4027651)
