We study coset weight distributions of binary primitive (narrow-sense) BCH codes of length n = 2 m (m odd) with minimum distance 8. In the previous paper , 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.
Problems of Information Transmission – Springer Journals
Published: Jan 23, 2006
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud