Probabilistic Analysis of Linear Programming Decoding
Daskalakis, C.
Dimakis, A.G.
Karp, R.M.
Wainwright, M.J.
Dept. of Electr. Eng. & Comput. Sci., Univ. of Berkeley, Berkeley, CA;
This paper appears in: Information Theory, IEEE Transactions on
Publication Date: Aug. 2008
Volume: 54,
Issue: 8
On page(s): 3565-3578
ISSN: 0018-9448
INSPEC Accession Number: 10115057
Digital Object Identifier: 10.1109/TIT.2008.926452
Current Version Published: 2008-07-16
Abstract
We initiate the probabilistic analysis of linear programming (LP) decoding of low-density parity-check (LDPC) codes. Specifically, we show that for a random LDPC code ensemble, the linear programming decoder of Feldman succeeds in correcting a constant fraction of errors with high probability. The fraction of correctable errors guaranteed by our analysis surpasses previous nonasymptotic results for LDPC codes, and in particular, exceeds the best previous finite-length result on LP decoding by a factor greater than ten. This improvement stems in part from our analysis of probabilistic bit-flipping channels, as opposed to adversarial channels. At the core of our analysis is a novel combinatorial characterization of LP decoding success, based on the notion of a flow on the Tanner graph of the code. An interesting by-product of our analysis is to establish the existence of ldquoprobabilistic expansionrdquo in random bipartite graphs, in which one requires only that almost every (as opposed to every) set of a certain size expands, for sets much larger than in the classical worst case setting.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
