Local-optimality guarantees based on paths for optimal decoding
From MaRDI portal
coding theoryerror probabilityiterative message-passing decodinglinear programming decodinglocal optimalitymaximum likelihoodrepeat-accumulate codesTanner codes
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorial optimization (90C27) Measures of information, entropy (94A17) Decoding (94B35)
Abstract: 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 unique maximum-likelihood (ML) optimality and unique 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 . 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.
Recommendations
This page was built for publication: Local-optimality guarantees based on paths for optimal decoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408609)
