Computer Science – Information Theory
Scientific paper
2012-03-08
Computer Science
Information Theory
Scientific paper
This paper presents a unified analysis framework that captures recent advances in the study of local-optimality characterizations for codes on graphs. These local-optimality characterizations are based on combinatorial structures embedded in the Tanner graph of the code. Local-optimality implies both maximum-likelihood (ML) optimality and linear-programming (LP) decoding optimality. Also, an iterative message-passing decoding algorithm is guaranteed to find the unique locally-optimal codeword, if one exists. We demonstrate this proof technique by considering a definition of local-optimality that is based on the simplest combinatorial structures in Tanner graphs, namely, paths of length $h$. We apply the technique of local optimality to a family of Tanner codes. Inverse polynomial bounds in the code length are proved on the word error probability of LP-decoding for this family of Tanner codes.
Even Guy
Halabi Nissim
No associations
LandOfFree
Local-Optimality Guaranties for Optimal Decoding Based on Paths 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 Guaranties for Optimal Decoding Based on Paths, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Local-Optimality Guaranties for Optimal Decoding Based on Paths will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-17796