On the covering radius of long binary BCH codes
Discrete Applied Mathematics
Long extended BCH codes are spanned by minimum weight words
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Polynomial Factorisation and an Application to Regular Directed Graphs
Finite Fields and Their Applications
| Hi-index | 0.00 |
It is proved that the coveringradius of a primitive binary BCH code of length q-1and designed distance 2t+1, where \[ q=2^m[(2t-3)(2t-1)!]^2,\] is exactly 2t-1 (the minimum value possible).The bound for q is significantly lower than theone obtained by O. Moreno and C. J. Moreno [9].