Error correcting codes and B_h-sequences
Combinatorics
2007-05-23 v1
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 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.
Keywords
Cite
@article{arxiv.math/0311385,
title = {Error correcting codes and B_h-sequences},
author = {Harm Derksen},
journal= {arXiv preprint arXiv:math/0311385},
year = {2007}
}
Comments
14 pages, one large 6-page table