By Topic

Cascade Decoding of Cyclic Product 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)
Abramson, Norman ; Hawaii Univ., Honolulu, HI, USA

In this paper, it is shown how to synthesize simple decoders for cyclic product codes. Cyclic product codes may be synthesized in the form of interlaced codes if the block lengths of the codes are relatively prime. In this case, the decoder can be synthesized in the form of a cascade of decoders, each of which operates on one of the subcodes forming the product code. The cascade decoders described differ from most of the decoders given in the coding literature in two major respects. First, they can be built. Second, instead of correcting all error patterns with weight less than some fixed value and no error patterns of greater weight, cascade decoders correct many error patterns beyond their guaranteed correction capability. Thus, the effective error-correction performance using a cascade decoder may be considerably beyond the usual Elias bound for product codes.

Published in:

Communication Technology, IEEE Transactions on  (Volume:16 ,  Issue: 3 )