Error correcting codes and B_h-sequences

Simple item page
dc.creatorDerksen, Harm
dc.date2003-11-21
dc.date.accessioned2026-07-07T05:03:09Z
dc.date.available2026-07-07T05:03:09Z
dc.descriptionWe 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.
dc.description14 pages, one large 6-page table
dc.identifierhttps://arxiv.org/abs/math/0311385
dc.identifierhttp://arxiv.org/abs/math/0311385
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/69299
dc.subjectCombinatorics
dc.subject94B65
dc.titleError correcting codes and B_h-sequences
dc.typetext

Files

Collections

arXiv