No label defined (Q4336977)
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 1009717
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1009717 |
Statements
13 August 1997
0 references
exponential sum
0 references
Gauss sum
0 references
algorithm
0 references
Weil bound
0 references
binary BCH code
0 references
0.8660019636154175
0 references
0.8429659008979797
0 references
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].
0 references
