2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/69299We 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.14 pages, one large 6-page tableCombinatorics94B65text