The Second Generalized Covering Radius of Binary Primitive Double-Error-Correcting BCH Codes
Information Theory
2024-09-17 v1 math.IT
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.
Cite
@article{arxiv.2409.10420,
title = {The Second Generalized Covering Radius of Binary Primitive Double-Error-Correcting BCH Codes},
author = {Lev Yohananov and Moshe Schwartz},
journal= {arXiv preprint arXiv:2409.10420},
year = {2024}
}