On the Block Error Probability of LP Decoding of LDPC Codes
arXiv:cs/0602086
Abstract
In his thesis, Wiberg showed the existence of thresholds for families of regular low-density parity-check codes under min-sum algorithm decoding. He also derived analytic bounds on these thresholds. In this paper, we formulate similar results for linear programming decoding of regular low-density parity-check codes.
Cited by in corpus (8)
- LDPC Codes for Compressed Sensing
- LP decoding of expander codes: a simpler proof
- LDPC Code Density Evolution in the Error Floor Region
- Bounds on the Threshold of Linear Programming Decoding
- Impact of redundant checks on the LP decoding thresholds of LDPC codes
- Local-Optimality Guarantees for Optimal Decoding Based on Paths
- Local Optimality Certificates for LP Decoding of Tanner Codes
- LP Decoding of Regular LDPC Codes in Memoryless Channels