Error-Correcting Codes and<tex>B_h</tex>-Sequences

DOI10.1109/TIT.2004.824915MaRDI QIDQ3546786zbMATH OpenOpenAlexFDO

Authors Harm Derksen

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0311385

Mathematics Subject Classification ID

Sequences (mod (m)) (11B50) Combinatorial codes (94B25) Synchronization error-correcting codes (94B50)

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.

Recommendations

• Improved lower bounds on sizes of single-error correcting codes
• Encoding and error-correction procedures for the Bose-Chaudhuri codes
• On error-correcting balanced codes
• A New Treatment of Bose-Chaudhuri Codes
• scientific article; zbMATH DE number 4200136

Cited in

(7)

• Error correcting sequence and projective de Bruijn graph
• A construction of \(V_{h}\)-sequences and its application to binary asymmetric error-correcting codes
• The Simplex Codes and Other Even-Weight Binary Linear Codes for Error Correction
• On error-correcting balanced codes
• scientific article; zbMATH DE number 928753 (Why is no real title available?)
• Improved bounds on Sidon sets via lattice packings of simplices
• A New Treatment of Bose-Chaudhuri Codes

This page was built for publication: Error-Correcting Codes and&lt;tex&gt;$B_h$&lt;/tex&gt;-Sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546786)