An approximation to the weight distribution of binary linear codes
IEEE Transactions on Information Theory
On the covering radius of long binary BCH codes
Discrete Applied Mathematics
Discrete Mathematics
The Length of Primitive BCH Codes with Minimal Covering Radius
Designs, Codes and Cryptography
Linear programming bounds for codes of small size
European Journal of Combinatorics
On the Distance Distributions of BCH Codes and Their Duals
Designs, Codes and Cryptography
Testing Polynomials over General Fields
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Testing Low-Degree Polynomials over Prime Fields
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
More on the covering radius of BCH codes
IEEE Transactions on Information Theory
On the traveling salesman problem in binary Hamming spaces
IEEE Transactions on Information Theory
The weight distributions of extended binary primitive BCH codes of length 128
IEEE Transactions on Information Theory
More on the distance distribution of BCH codes
IEEE Transactions on Information Theory
A low-weight trellis-based iterative soft-decision decoding algorithm for binary linear block codes
IEEE Transactions on Information Theory
Minimum-weight codewords as generators of generalized Reed-Muller codes
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Bases of Minimum-Weight Vectors for Codes from Designs
Finite Fields and Their Applications
Succinct Representation of Codes with Applications to Testing
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
| Hi-index | 0.00 |
It is shown that long enough extended t-error correcting BCH codes Btare spanned by its lightest words of weight 2t + 2. The proof follows from an upper bound on the number of words of weight 2t + 2 in any subcode of Btof codimension 1.