Title :
Error-correcting codes and Bh-sequences
Author_Institution :
Dept. of Math., Univ. of Michigan, Ann Arbor, MI, USA
fDate :
3/1/2004 12:00:00 AM
Abstract :
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 word length ≤512 with 1≤h≤14. We give asymptotical comparisons to shortened Bose-Chaudhuri-Hocquenghem (BCH) codes.
Keywords :
BCH codes; binary codes; binary sequences; error correction codes; nonlinear codes; BCH code; Bose-Chaudhuri-Hocquenghem code; additive number theory; binary sequence; code table; code word length; constant weight code; error-correcting code; nonlinear binary code; Binary codes; Error correction codes; Hamming distance; Mathematics; Polynomials; Rain; Web pages;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2004.824915
