Jon Feldman, Tal Malkin, Rocco A. Servedio, Cliff Stein, Martin J. Wainwright  Home/Search
Context Related
| columbia.edu/reports/te...tr200308.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: columbia.edu/report...techreports (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We show that for low-density parity-check (LDPC) codes with sucient expansion, the Linear Programming (LP) Decoder of Feldman, Karger and Wainwright (Allerton, 2003) can correct a constant fraction of errors. More speci cally, we show that if the Tanner graph modeling the code has regular left degree c and expands by a factor more than c on all variable node sets of size at most n, where > + 3c , then the LP decoder succeeds as long as at most 2 1 ( n 1) bits are ipped by the... (Update)
Cited by: More
Treewidth-Based Conditions for Exactness - Of The Sherali-Adams (Correct)
Active bibliography (related documents): More All
4.3: LP Decoding Corrects a Constant Fraction of Errors - Feldman, Malkin, Servedio.. (2003) (Correct)
0.6: Near-Optimal Linear-Time Codes for Unique Decoding and New.. - Guruswami, Indyk (2002) (Correct)
0.5: On the Relationship between Linear Programming Decoding and.. - Vontobel, Koetter (2004) (Correct)
Similar documents based on text: More All
0.3: LP Decoding Achieves Capacity - Feldman, Stein (2004) (Correct)
0.2: Boosting and Hard-Core Sets - Klivans, Servedio (1999) (Correct)
0.2: Smooth Boosting and Learning with Malicious Noise - Servedio (2003) (Correct)
BibTeX entry: (Update)
J. Feldman, T. Malkin, R. A. Servedio, C. Stein, and M. J. Wainwright. LP decoding corrects a constant fraction of errors. Technical Report CORC Technical Report TR-2003-08, Operations Research, Columbia University, December 2003. http://citeseer.ist.psu.edu/feldman03lp.html More
@misc{ feldman03lp,
author = "J. Feldman and T. Malkin and R. Servedio and C. Stein and M. Wainwright",
title = "LP decoding corrects a constant fraction of errors",
text = "J. Feldman, T. Malkin, R. A. Servedio, C. Stein, and M. J. Wainwright.
LP decoding corrects a constant fraction of errors. Technical Report CORC
Technical Report TR-2003-08, Operations Research, Columbia University, December
2003.",
year = "2003",
url = "citeseer.ist.psu.edu/feldman03lp.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 2001
717 Theory of Linear and Integer Programming (context) - Schrijver - 1987
559 Near Shannon limit error-correcting coding and decoding: tur.. (context) - Berrou, Glavieux et al. - 1993
341 Low-density parity-check codes (context) - Gallager - 1962
137 Prentice-Hall (context) - Ahuja, Magnanti et al. - 1993
99 The capacity of low-density parity-check codes under message.. - Richardson, Urbanke - 2001
88 A recursive approach to low complexity codes (context) - Tanner - 1981
61 Design of capacity approaching irregular low-density parity .. (context) - Richardson, Shokrollahi et al. - 2001
59 Codes and Decoding on General Graphs - Wiberg - 1996
44 Improved low-density paritycheck codes using irregular graph.. - Luby, Mitzenmacher et al. - 1998
32 IEEE Transactions on Information Theory (context) - Sipser, Spielman - 1996
14 and new constant-degree expanders and extractors (context) - Reingold, Vadhan et al. - 2000
11 Finite length analysis of low-density parity check codes (context) - Di and, Proietti et al. - 2002
8 IEEE Transaction of Information Theory (context) - emor, codes - 2001
8 Randomness conductors and constant-degree expansion beyond t.. (context) - Capalbo, Reingold et al. - 2002
8 IEEE Transactions on Information Theory (context) - Barg, emor et al. - 2002
8 Expander-based constructions of eciently decodable codes (context) - Guruswami, Indyk - 2001
5 Signal-space characterization of iterative decoding - Frey, Koetter et al. - 2001
5 Decoding Error-Correcting Codes via Linear Programming (context) - Feldman - 2003
4 Decoding turbo-like codes via linear programming (context) - Feldman, Karger - 2002
3 Personal communication (context) - Koetter - 2002
3 Using linear programming to decode linear codes - Feldman, Wainwright et al. - 2003
2 LP decoding (context) - Feldman, Karger et al. - 2003
2 Improved bounds on the word error probability of RA (context) - Even, Halabi - 2003
2 ective weights of pseudocodewords for codes de ned on graphs.. (context) - Forney, Koetter et al. - 2001
2 Graph-covers and iterative decoding of nite length codes (context) - Koetter, Vontobel - 2003
Documents on the same site (http://www.corc.ieor.columbia.edu/reports/techreports.html): More
Experiments With a Network Design Algorithm Using.. - Bienstock (1998) (Correct)
Many-to-one Stable Matching: Geometry and Fairness - Sethuraman, Teo, Qian (2004) (Correct)
Concurrent Flows in O*(1/ε) iterations - Bienstock, Iyengar (2004) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC