Error Correction Capability of Column-Weight-Three LDPC Codes

Details Error Correction Capability of Column-Weight-Three LDPC Codes Error Correction Capability of Column-Weight-Three LDPC Codes

2007-10-18

arxiv.org/abs/0710.3427v1

Computer Science

Information Theory

16 pages, 3 figures. Submitted to IEEE Transactions on Information Theory

Scientific paper

In this paper, we investigate the error correction capability of column-weight-three LDPC codes when decoded using the Gallager A algorithm. We prove that the necessary condition for a code to correct $k \geq 5$ errors is to avoid cycles of length up to $2k$ in its Tanner graph. As a consequence of this result, we show that given any $\alpha>0, \exists N $ such that $\forall n>N$, no code in the ensemble of column-weight-three codes can correct all $\alpha n$ or fewer errors. We extend these results to the bit flipping algorithm.

Affiliated with

Also associated with

No associations

Rating

Error Correction Capability of Column-Weight-Three LDPC Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Error Correction Capability of Column-Weight-Three LDPC Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Error Correction Capability of Column-Weight-Three LDPC Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-460690