By Topic

Step-by-step decoding of the Bose-Chaudhuri- Hocquenghem 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
$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)

A new and conceptually simple decoding procedure is developed for all of the cyclic Bose-Chaudhuri-Hocquenghem codes. Iftis the number of errors guaranteed correctable by the Bose-Chaudhuri bound, then any pattern oftor fewer errors can be corrected in a step-by-step manner using this procedure. In the binary case, the method requires only the determination of whether at times tmatrix is singular. In the general case, the method requires only the determination of whether at times tmatrix and a(t+1) times (t+1)matrix are simultaneously singular. Circuits to implement the algorithm are developed and two detailed examples are given. Finally, the step-by-step procedure is compared to other known methods for decoding the Bose-Chaudhuri-Hocquenghem codes.

Published in:

Information Theory, IEEE Transactions on  (Volume:11 ,  Issue: 4 )