On the Hardness of Approximating Stopping and Trapping Sets in LDPC Codes

Details On the Hardness of Approximating Stopping and Trapping Sets in LDPC Codes On the Hardness of Approximating Stopping and Trapping Sets in LDPC Codes

2007-04-18

arxiv.org/abs/0704.2258v2

Computer Science

Information Theory

16 pages, 6 figure, submitted journal version

Scientific paper

We prove that approximating the size of stopping and trapping sets in Tanner graphs of linear block codes, and more restrictively, the class of low-density parity-check (LDPC) codes, is NP-hard. The ramifications of our findings are that methods used for estimating the height of the error-floor of moderate- and long-length LDPC codes based on stopping and trapping set enumeration cannot provide accurate worst-case performance predictions.

Affiliated with

Also associated with

No associations

Rating

On the Hardness of Approximating Stopping and Trapping Sets in 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 Hardness of Approximating Stopping and Trapping Sets in LDPC Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Hardness of Approximating Stopping and Trapping Sets in LDPC Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-404564