Cart (Loading....) | Create Account
Close category search window
 

Performance of a general decoding technique over the class of randomly chosen parity check 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

2 Author(s)
Oh, K.T. ; Dept. of Electr. & Comput. Eng., Pennsylvania State Univ., University Park, PA, USA ; Matzner, J.J.

The paper extends a general decoding technique developed by Metzner and Kapturowski (1990) for concatenated code outer codes and for file disagreement location. That work showed the ability to correct most cases of d-2 or fewer erroneous block symbols, where d is the outer code minimum distance. Any parity check code can be used as the basis for the outer codes, and yet decoding complexity increases at most as the third power of the code length. In this correspondence, it is shown that, with a slight modification and no significant increase in complexity, the general decoding technique can be applied to the correction of many other cases beyond the code minimum distance. By considering average performance over all binary randomly chosen codes, it is seen that most error patterns of tM or fewer block errors can be corrected, where: 1) tM in most cases is much greater than the code minimum distance, and 2) asymptotically, the ratio of tM to the theoretical maximum (the number of parity symbol blocks) approaches 1. Moreover, most cases of noncorrectable error block patterns are detected

Published in:

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

Date of Publication:

Jan 1994

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.