The Second Generalized Covering Radius of Binary Primitive Double-Error-Correcting BCH Codes
Lev Yohananov, Moshe Schwartz
TL;DR
This paper precisely calculates the second covering radius for a specific class of binary BCH codes that correct two errors, and offers bounds for codes correcting more errors, advancing understanding of their covering properties.
Contribution
It provides a complete determination of the second covering radius for binary primitive double-error-correcting BCH codes and establishes a lower bound for codes correcting more than two errors.
Findings
Exact second covering radius for binary primitive double-error-correcting BCH codes.
Lower bounds on the second covering radius for BCH codes correcting more than two errors.
Enhanced understanding of covering properties of 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Advanced Wireless Communication Techniques