Computer Science – Information Theory
Scientific paper
2006-06-12
Computer Science
Information Theory
17 pages, 1 figure
Scientific paper
In this correspondence, we study the minimum pseudo-weight and minimum pseudo-codewords of low-density parity-check (LDPC) codes under linear programming (LP) decoding. First, we show that the lower bound of Kelly, Sridhara, Xu and Rosenthal on the pseudo-weight of a pseudo-codeword of an LDPC code with girth greater than 4 is tight if and only if this pseudo-codeword is a real multiple of a codeword. Then, we show that the lower bound of Kashyap and Vardy on the stopping distance of an LDPC code is also a lower bound on the pseudo-weight of a pseudo-codeword of this LDPC code with girth 4, and this lower bound is tight if and only if this pseudo-codeword is a real multiple of a codeword. Using these results we further show that for some LDPC codes, there are no other minimum pseudo-codewords except the real multiples of minimum codewords. This means that the LP decoding for these LDPC codes is asymptotically optimal in the sense that the ratio of the probabilities of decoding errors of LP decoding and maximum-likelihood decoding approaches to 1 as the signal-to-noise ratio leads to infinity. Finally, some LDPC codes are listed to illustrate these results.
Fu Fang-Wei
Xia Shu-Tao
No associations
LandOfFree
Minimum Pseudo-Weight and Minimum Pseudo-Codewords 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 Minimum Pseudo-Weight and Minimum Pseudo-Codewords of LDPC Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimum Pseudo-Weight and Minimum Pseudo-Codewords of LDPC Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-647769