All binary 3-error-correcting BCH codes of length<tex>2ᵐ-i</tex>have covering radius 5 (Corresp.)

DOI10.1109/TIT.1978.1055847MaRDI QIDQ4149643zbMATH OpenFDO

Authors Tor Helleseth

Publication date 1978

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

Full work available at URL https://doi.org/10.1109/TIT.1978.1055847

Mathematics Subject Classification ID

Theory of error-correcting codes and error-detecting codes (94B99)

Cited in

(6)

• On the covering radius of cyclic linear codes and arithmetic codes
• The covering radii of a class of binary cyclic codes and some BCH codes
• Correspondence between steganographic protocols and error correcting codes
• The weight distributions of three new classes of binary linear codes
• The second generalized covering radius of binary primitive double-error-correcting BCH codes
• The weight distribution of the coset leaders for some classes of codes with related parity-check matrices

This page was built for publication: All binary 3-error-correcting BCH codes of length&lt;tex&gt;2^m-i&lt;/tex&gt;have covering radius 5 (Corresp.)

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