IEEE Transactions on Information Theory · 1992 · 14 citations · 5 references
Natural SciencesComputer ScienceMathematicsCombinatoricsDiscrete MathematicsInformation TheoryChannel CodingCoding TheoryError-correcting CodesBch CodesBinary CodesBounds On CodesConverse BoundsHamming Distance
An infinite series of duals of binary BCH codes with designed distance delta =9 and lengths l=2/sup n/ with n odd is found, such that their weights almost satisfy the Carlitz-Uchiyama bound. This solves negatively a problem formulated by F.J. MacWilliams and N.J.A. Sloane (1977).< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
5
André Weil · Proceedings of the National Academy of Sciences · 1948 · 792 citations · Full text
On estimates of complete trigonometric sums
A. A. Karatsuba · Mathematical Notes · 1967 · 26 citations