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

DOI10.1109/TIT.1978.1055847zbMath0371.94021MaRDI QIDQ4149643

Tor Helleseth

Publication date: 1978

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

Mathematics Subject Classification ID

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

Related Items (4)

Unnamed Item ⋮ The covering radii of a class of binary cyclic codes and some BCH codes ⋮ The weight distribution of the coset leaders for some classes of codes with related parity-check matrices ⋮ On the covering radius of cyclic linear codes and arithmetic codes

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.)