By Topic

Iterated codes with improved performance (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

2 Author(s)

Improvements on the rates of iterated codes for error-free decoding on the binary symmetric channel are presented. Approximations to the performance of Elias's original error-free codes are replaced with virtually exact results that demonstrate higher code rates and the ability to decode from noisier channels than the original results indicated. Prefacing an Elias code with iterations of one or more primitive Bose-Chaudhuri-Hoequenghem (BCH) codes is shown to provide error-free decoding for any channel with p \leq 0.42 and to yield code rates closer to capacity than those of Elias's original code. An heuristic algorithm is given for selecting an efficient set of BCH codes to iterate.

Published in:

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