2003/11/21 by Harm Derksen, Derksen, Harm
Computer Science · Mathematics · #94B65 #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:94B65
paper · pdf · doi:10.48550/arxiv.math/0311385
14 pages, one large 6-page table
arxiv created 2003/11/21 · openalex publication_date 2003/11/21 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We construct error correcting nonlinear binary codes using a construction of Bose and Chowla in additive number theory. Our method extends a construction of Graham and Sloane for constant weight codes. The new codes improve 1028 of the 7168 best known h-error correcting codes of wordlength at most 512 and h at most 14. We give assymptotical comparisons to shortened BCH codes. Tables of new lower bounds for "A(n,d)" are included.