On the guaranteed error correction capability of LDPC codes

Details On the guaranteed error correction capability of LDPC codes On the guaranteed error correction capability of LDPC codes

2008-01-08

arxiv.org/abs/0801.1276v1

Computer Science

Information Theory

5 pages, submitted to IEEE International Symposium on Information Theory (ISIT), 2008

Scientific paper

We investigate the relation between the girth and the guaranteed error correction capability of $\gamma$-left regular LDPC codes when decoded using the bit flipping (serial and parallel) algorithms. A lower bound on the number of variable nodes which expand by a factor of at least $3 \gamma/4$ is found based on the Moore bound. An upper bound on the guaranteed correction capability is established by studying the sizes of smallest possible trapping sets.

Affiliated with

Also associated with

No associations

Rating

On the guaranteed error correction capability of 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 On the guaranteed error correction capability of LDPC codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the guaranteed error correction capability of LDPC codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-421610