By Topic

Complete decoding of triple-error-correcting binary BCH codes

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
$33 $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

2 Author(s)

An extensive study of binary triple-error-correcting codes of primitive length n = 2^{m} - 1 is reported that results in a complete decoding algorithm whenever the maximum coset weight W_{\max } is five. In this regard it is shown that W_{\max } = 5 when four divides m , and strong support is provided for the validity of the conjecture that W_{\max } = 5 for all m . The coset weight distribution is determined exactly in some cases and bounded in others.

Published in:

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