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

Error Correction Capability of Column-Weight-Three LDPC Codes Under the Gallager A Algorithm—Part II

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

4 Author(s)
Chilappagari, S.K. ; Marvell Semicond., Inc., Santa Clara, CA, USA ; Nguyen, D.V. ; Vasic, B. ; Marcellin, M.W.

The relation between the girth and the error correction capability of column-weight-three LDPC codes under the Gallager A algorithm is investigated. It is shown that a column-weight-three LDPC code with Tanner graph of girth g ¿ 10 can correct all error patterns with up to (g/2-1) errors in at most g/2 iterations of the Gallager A algorithm. For codes with Tanner graphs of girth g ¿ 8, it is shown that girth alone cannot guarantee correction of all error patterns with up to (g/2-1) errors under the Gallager A algorithm. Sufficient conditions to correct (g/2-1) errors are then established by studying trapping sets.

Published in:

Information Theory, IEEE Transactions on  (Volume:56 ,  Issue: 6 )

Date of Publication:

June 2010

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.