LP Decoding Corrects a Constant Fraction of Errors

DOI10.1109/TIT.2006.887523zbMATH Open1234.94085MaRDI QIDQ3548232FDOQ3548232

Authors: Jon Feldman, Tal Malkin, Martin J. Wainwright, Rocco A. Servedio, Clifford Stein 

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Recommendations

• Probabilistic Analysis of Linear Programming Decoding
• Probabilistic Analysis of Linear Programming Decoding
• Message passing algorithms and improved LP decoding
• LP decoding achieves capacity
• Using Linear Programming to Decode Binary Linear Codes

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Cyclic codes (94B15) Decoding (94B35)

Cited In (12)

• Improved Bounds on the Word Error Probability of<tex>$RA(2)$</tex>Codes With Linear-Programming-Based Decoding
• Probabilistic Analysis of Linear Programming Decoding
• Minimum Pseudoweight and Minimum Pseudocodewords of LDPC Codes
• Asymptotic estimation of the fraction of errors correctable by \(q\)-ary LDPC codes
• Decoding turbo-like codes via linear programming
• Low-power LDPC decoding by exploiting the fault-tolerance of the sum-product algorithm
• On linear programming decoding on a quantized additive white Gaussian noise channel
• On the Error Correction of Regular LDPC Codes Using the Flipping Algorithm
• Title not available (Why is that?)
• Using Linear Programming to Decode Binary Linear Codes
• Characterizations of pseudo-codewords of (low-density) parity-check codes
• Error bounds for repeat-accumulate codes decoded via linear programming

This page was built for publication: LP Decoding Corrects a Constant Fraction of Errors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548232)