scientific article; zbMATH DE number 1009717
Gauss and Kloosterman sums; generalizations (11L05) Estimates on exponential sums (11L07) Exponential sums (11T23) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cyclic codes (94B15) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Bounds on codes (94B65)
In research problem (9.5), \textit{F. J. MacWilliams} and \textit{N. A. Sloane} [The theory of error-correcting codes, North-Holland (1977; Zbl 0369.94008)] asked whether the weight of a nonzero codeword of the dual of a binary BCH code of designed distance \(\delta\) satisfies a bound that is somewhat better than the Carlitz-Uchiyama bound. While this question has a positive answer for \(\delta=3,5,7\), the author showed in [IEEE Trans. Inf. Theory 38, 478-479 (1992; Zbl 0744.94017)] that the answer is negative for \(\delta=9\). In an earlier paper (part I) [In: Coding theory and algebraic geometry, Proc. Int. Workshop, Luminy/Fr. 1991, Lect. Notes Math. 1518, 199-209 (1992; Zbl 0763.11047)], the author related this problem to a lower bound for a certain exponential sum involving a polynomial of degree \(\delta-2\) and showed that for infinitely many \(\delta\), the question of MacWilliams and Sloane has a negative answer. In the present article, the author gives an algorithm for determining whether this exponential sum asymptotically attains the Weil bound when \(\delta-2\) is an odd prime, and uses this to produce more cases where the answer to the question of MacWilliams and Sloane is negative. For the entire collection see [Zbl 0859.00020].
- Upper bounds on a two-term exponential sum
- Lower bound for certain binary exponential sums
- scientific article; zbMATH DE number 493084 (Why is no real title available?)
- scientific article; zbMATH DE number 1472122 (Why is no real title available?)
- The MacWilliams-Sloane conjecture on the tightness of the Carlitz-Uchiyama bound and the weights of duals of BCH codes
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 Q4336977)
