LP Decoding Corrects a Constant Fraction of Errors

Abstract

We show that for low-density parity-check (LDPC) codes whose Tanner graphs have sufficient expansion, the linear programming (LP) decoder of Feldman, Karger, and Wainwright can correct a constant fraction of errors. A random graph will have sufficient expansion with high probability, and recent work shows that such graphs can be constructed efficiently. A… (More)
DOI: 10.1109/TIT.2006.887523

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Statistics

01020'05'07'09'11'13'15'17
Citations per Year

144 Citations

Semantic Scholar estimates that this publication has 144 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics