The Exact Second Generalized Covering Radius of Binary Primitive Triple-Error-Correcting BCH Codes

Abstract

Let $C_m:=\mathrm{BCH}(3,m)$ be the binary primitive triple-error-correcting BCH code of length $2^m-1$. We determine its second generalized covering radius exactly: $R_2(C_m)=8$ for every $m\geq5$. Equivalently, every two-dimensional syndrome subspace is contained in the binary span of at most eight parity-check columns, and eight columns are necessary in the worst case. This matches the known lower bound.