Asymptotically Tight Bounds for Generalized Covering Radii of Binary Primitive BCH Codes at All Higher Orders

@misc{belinsky2026asymptotically,
  title = {{Asymptotically Tight Bounds for Generalized Covering Radii of Binary Primitive BCH Codes at All Higher Orders}},
  author = {Zeev Vladimir Belinsky and Aryeh Lev Zabokritskiy},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2608.23833},
  eprint = {2608.23833},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2608.23833},
}

TY  - UNPB
TI  - Asymptotically Tight Bounds for Generalized Covering Radii of Binary Primitive BCH Codes at All Higher Orders
AU  - Zeev Vladimir Belinsky
AU  - Aryeh Lev Zabokritskiy
PY  - 2026
DA  - 2026/09/29
PB  - arXiv
DO  - 10.48550/arxiv.2608.23833
UR  - https://arxiv.org/abs/2608.23833
AB  - We study the generalized covering radii of binary primitive BCH codes, which measure how many parity-check columns suffice to span several prescribed syndromes. For the four-error-correcting family of length 2^m−1, the second radius is exactly $11$ for m≥55, and it is either $11$ or $12$ for m≥16. For every fixed error parameter at least two, we give an explicit stable bound with two adjacent possible values for the second radius and an arithmetic criterion for exactness. At every higher order, we obtain explicit lower and upper bounds whose additive gap is bounded independently of the order for each fixed error parameter, once explicit field-size conditions hold. The bounds are therefore asymptotically tight as the order grows. The higher-order upper bound retains the common-core support count established by Xiong, Yip, and Zullo; our refinement reduces its sufficient field-size threshold at large order. The refinement combines componentwise mixed degrees with the ordinary degree of a multicone. The upper bounds come from constructing syndrome representations with a common set of parity-check columns.
ER  -