Reweighted LP Decoding for LDPC Codes
Information Theory
2011-03-16 v1 math.IT
Abstract
We introduce a novel algorithm for decoding binary linear codes by linear programming. We build on the LP decoding algorithm of Feldman et al. and introduce a post-processing step that solves a second linear program that reweights the objective function based on the outcome of the original LP decoder output. Our analysis shows that for some LDPC ensembles we can improve the provable threshold guarantees compared to standard LP decoding. We also show significant empirical performance gains for the reweighted LP decoding algorithm with very small additional computational complexity.
Cite
@article{arxiv.1103.2837,
title = {Reweighted LP Decoding for LDPC Codes},
author = {Amin Khajehnejad and Alexandros G. Dimakis and Babak Hassibi and Benjamin Vigoda and William Bradley},
journal= {arXiv preprint arXiv:1103.2837},
year = {2011}
}