By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

Van der Horst and Berger have conjectured that the covering radius of the binary 3-error-correcting Bose-Chaudhuri-Hocquenghem (BCH) code of length 2^{m} - l, m \geq 4 is 5. Their conjecture was proved earlier when m \equiv 0, 1 , or 3 (mod 4). Their conjecture is proved when m \equiv 2 (mod 4).

Published in:

Information Theory, IEEE Transactions on  (Volume:24 ,  Issue: 2 )