Mathematical Programming Decoding of Binary Linear Codes: Theory and Algorithms
arXiv:1107.3715 · doi:10.1109/TIT.2012.2191697
Abstract
Mathematical programming is a branch of applied mathematics and has recently been used to derive new decoding approaches, challenging established but often heuristic algorithms based on iterative message passing. Concepts from mathematical programming used in the context of decoding include linear, integer, and nonlinear programming, network flows, notions of duality as well as matroid and polyhedral theory. This survey article reviews and categorizes decoding methods based on mathematical programming approaches for binary linear codes over binary-input memoryless symmetric channels.
arXiv comment17 pages, submitted to the IEEE Transactions on Information Theory. Published July 2012
References in corpus (7)
- Maximum Weight Matching via Max-Product Belief Propagation
- Loop series for discrete statistical models on graphs
- Loop Calculus in Statistical Physics and Information Science
- Linear-Programming Decoding of Nonbinary Linear Codes
- A Decomposition Theory for Binary Linear Codes
- Efficient Linear Programming Decoding of HDPC Codes
- Polytope of Correct (Linear Programming) Decoding and Low-Weight Pseudo-Codewords