2011/01/27 by Luis Javier García Villalba, José René Fuentes Cortez, Villalba, Luis Javier García +5
Computer Science · Engineering · #Advanced Wireless Communication Techniques #Coding theory and cryptography #Discrete Mathematics (cs.DM) #Error Correcting Code Techniques #FOS: Computer and information sciences #VLSI and Analog Circuit Testing #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1101.5411
openalex publication_date 2011/01/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In a previous work it was shown that the best measure for the efficiency of a\nsingle burst-correcting code is obtained using the Gallager bound as opposed to\nthe Reiger bound. In this paper, an efficient algorithm that searches for the\nbest (shortened) cyclic burst-correcting codes is presented. Using this\nalgorithm, extensive tables that either tie existing constructions or improve\nthem are obtained for burst lengths up to b=10.\n