On Coset Weight Distributions of the 3-Error-Correcting BCH-Codes
SIAM Journal on Discrete Mathematics
On Z_4-Linear Goethals Codes and KloostermanSums
Designs, Codes and Cryptography - Special issue on designs and codes—a memorial tribute to Ed Assmus
Handbook of Coding Theory
The divisibility modulo 24 of Kloosterman sums on GF(2m), m odd
Journal of Combinatorial Theory Series A
Large families of quaternary sequences with low correlation
IEEE Transactions on Information Theory
Worst-case interactive communication. I. Two messages are almost optimal
IEEE Transactions on Information Theory
The coset distribution of triple-error-correcting binary primitive BCH codes
IEEE Transactions on Information Theory
The divisibility modulo 24 of Kloosterman sums on GF(2m), m odd
Journal of Combinatorial Theory Series A
A family of m-sequences with five-valued cross correlation
IEEE Transactions on Information Theory
Further results on m-sequences with five-valued cross correlation
IEEE Transactions on Information Theory
Hi-index | 0.12 |
We study coset weight distributions of binary primitive (narrow-sense) BCH codes of length n = 2m (m odd) with minimum distance 8. In the previous paper [1], we described coset weight distributions of such codes for cosets of weight j = 1, 2, 3, 5, 6. Here we obtain exact expressions for the number of codewords of weight 4 in terms of exponential sums of three types, in particular, cubic sums and Kloosterman sums. This allows us to find the coset distribution of binary primitive (narrow-sense) BCH codes with minimum distance 8 and also to obtain some new results on Kloosterman sums over finite fields of characteristic 2.