The Second Generalized Covering Radius of Binary Primitive
Double-Error-Correcting BCH Codes
Abstract
We completely determine the second covering radius for binary primitive
double-error-correcting BCH codes. As part of this process, we provide a lower
bound on the second covering radius for binary primitive BCH codes correcting
more than two errors.