Error-correcting codes and B/sub h/-sequences

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 /spl les/512 with 1/spl les/h/spl les/14. We give asymptotical comparisons to shortened Bose-Chaudhuri-Hocquenghem (BCH) codes.