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

2024/09/16 by Lev Yohananov, Yohananov, Lev, Moshe Schwartz +1
Computer Science · Engineering · #Advanced Wireless Communication Techniques #Coding theory and cryptography #FOS: Computer and information sciences #Information Theory (cs.IT)

paper · pdf · doi:10.48550/arxiv.2409.10420

openalex publication_date 2024/09/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• New Families of Triple Error Correcting Codes with BCH Parameters
• Triple-Error-Correcting BCH-Like Codes
• The Dimension and Minimum Distance of Two Classes of Primitive BCH Codes
• A Class of Narrow-Sense BCH Codes
• On the Covering Radius of the Second Order Reed-Muller Code of Length 128