2008/03/25 by Carl Bracken, Bracken, Carl
Computer Science · Engineering · Mathematics · #Algorithm #BCH code #Coding theory and cryptography #Computer science #Discrete Mathematics (cs.DM) #Error Correcting Code Techniques #Error detection and correction #FOS: Computer and information sciences #Information Theory (cs.IT) #Mathematics #cs.DM #cs.IT #graph theory and CDMA systems #math.IT
paper · pdf · doi:10.48550/arxiv.0803.3553
11 pages. Submitted to IEEE Transactions on information Theory
arxiv created 2008/03/25 · openalex publication_date 2008/03/25 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
Discovered by Bose, Chaudhuri and Hocquenghem, the BCH family of error correcting codes are one of the most studied families in coding theory. They are also among the best performing codes, particularly when the number of errors being corrected is small relative to the code length. In this article we consider binary codes with minimum distance of 7. We construct new families of codes with these BCH parameters via a generalisation of the Kasami-Welch Theorem.