On the weights of the elements of the duals of binary BCH codes
From MaRDI portal
[For the entire collection see Zbl 0758.00016.] The only result derived in this paper is as follows: Theorem. Let \(C_ m\) be a binary BCH code of length \(2^ m-1\) with designed distance \(\delta=2t+1=33\). For every \(m\) there exists a nonzero codeword of weight \(w_ m\) such that \(\mathop{\text{lim sup}}\limits_{m\text{ odd}}{| w_ m-2^{m-1}|\over 2^{m/2}}=t-1\). This theorem is a variant of the Carlitz-Uchiyama bound on the weight of a nonzeero codeword in the dual of \(C_ m\).
Recommendations
- The weights of the duals of binary BCH codes of designed distance =9
- Weight of duals of BCH codes and exponential sums
- Poids des duaux des codes BCH de distance prescrite 2a+1 et sommes exponentielles
- On generalized Hamming weights of \(\text{BCH}(2)^\perp\)
- scientific article; zbMATH DE number 493084
Cited in
(11)- On weights in duadic Abelian codes
- Weight of duals of BCH codes and exponential sums
- Asymptotic estimation of the minimum distance of the duals of BCH codes and Dickson polynomials
- scientific article; zbMATH DE number 3458467 (Why is no real title available?)
- scientific article; zbMATH DE number 493084 (Why is no real title available?)
- scientific article; zbMATH DE number 559154 (Why is no real title available?)
- Weight distributions of cosets of two-error-correcting binary BCH codes, extended or not
- On minimum Lee weights of Hensel lifts of some binary BCH codes
- Poids des duaux des codes BCH de distance prescrite pa0et sommes exponentielles
- The weights of the duals of binary BCH codes of designed distance =9
- A class of primitive BCH codes and their weight distribution
This page was built for publication: On the weights of the elements of the duals of binary BCH codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4038774)
