Local Optimality Certificates for LP Decoding of Tanner Codes

Details Local Optimality Certificates for LP Decoding of Tanner Codes Local Optimality Certificates for LP Decoding of Tanner Codes

2011-04-24

arxiv.org/abs/1104.4646v1

Computer Science

Information Theory

Scientific paper

We present a new combinatorial characterization for local optimality of a codeword in an irregular Tanner code. The main novelty in this characterization is that it is based on a linear combination of subtrees in the computation trees. These subtrees may have any degree in the local code nodes and may have any height (even greater than the girth). We expect this new characterization to lead to improvements in bounds for successful decoding. We prove that local optimality in this new characterization implies ML-optimality and LP-optimality, as one would expect. Finally, we show that is possible to compute efficiently a certificate for the local optimality of a codeword given an LLR vector.

Affiliated with

Also associated with

No associations

Rating

Local Optimality Certificates for LP Decoding of Tanner 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 Local Optimality Certificates for LP Decoding of Tanner Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Local Optimality Certificates for LP Decoding of Tanner Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-624500