Message-passing algorithms and improved LP decoding

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2009, Pages 3-12

  Arora, Sanjeev ^a   Daskalakis, Constantinos ^b   Steurer, David ^a  

^a PRINCETON UNIVERSITY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

LDPC codes; LP decoding; Messagepassing algorithms; Min sum algorithm

Indexed keywords

CODEWORD; COMPRESSED SENSING; ERROR RATE; EXPANDER GRAPHS; ITERATIVE DECODER; ITERATIVE DECODING ALGORITHM; LDPC CODES; LINEAR PROGRAMMING DECODING; LINEAR PROGRAMS; LOW-DENSITY PARITY-CHECK CODES; LP DECODING; MESSAGE PASSING ALGORITHM; MESSAGEPASSING ALGORITHMS; MIN-SUM; MIN-SUM ALGORITHM; NEAR-LINEAR TIME; ORDERS OF MAGNITUDE; RANDOM NOISE;

ALGORITHMS; BIT ERROR RATE; BUILDING CODES; CODES (SYMBOLS); COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATION THEORY; DYNAMIC PROGRAMMING; ERRORS; LINEAR PROGRAMMING; LINEARIZATION; MESSAGE PASSING; OPTICAL COMMUNICATION; OPTIMIZATION;

ITERATIVE DECODING;

EID: 70350700914     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1536414.1536418     Document Type: Conference Paper

References (18)

1. E. J. Candès and T. Tao. Near-optimal signal recovery from random projections: Universal encoding strategies? IEEE Transactions on Information Theory, 52(12):5406-5425, 2006.
2. J. Chen, A. Dholakia, E. Eleftheriou, M. Fossorier, and X.-Y. Hu. Reduced-complexity decoding of LDPC codes. Communications, IEEE Transactions on, 53(8):1288-1299, Aug. 2005.
3. J. Chen and M. Fossorier. Density evolution for two improved BP-based decoding algorithms of LDPC codes. Communications Letters, IEEE, 6(5):208-210, May 2002.
4. J. Chen and M. Fossorier. Near optimum universal belief propagation based decoding of low-density parity check codes. Communications, IEEE Transactions on, 50(3):406-414, Mar 2002.
5. C. Daskalakis, A. G. Dimakis, R. M. Karp, and M. J. Wainwright. Probabilistic analysis of linear programming decoding. IEEE Transactions on Information Theory, 54(8):3565-3578, 2008.
6. J. Feldman and D. R. Karger. Decoding turbo-like codes via linear programming. J. Comput. System Sci., 68(4):733-752, 2004.
7. J. Feldman, T. Malkin, R. A. Servedio, C. Stein, and M. J. Wainwright. Lp decoding corrects a constant fraction of errors. IEEE Transactions on Information Theory, 53(1):82-89, 2007.
8. J. Feldman, M. J. Wainwright, and D. R. Karger. Using linear programming to decode binary linear codes. IEEE Trans. Inform. Theory, 51(3):954-972, 2005.
9. B. J. Frey and R. Koetter. The attenuated max-product algorithm. In Advanced mean eld methods (Birmingham, 1999), Neural Inf. Process. Ser., pages 213-227. MIT Press, Cambridge, MA, 2001.
10. R. G. Gallager. Low-density parity check codes. MIT Press, Cambridge, MA, 1963.
11. n1 via expander codes. In SODA, pages 353-362, 2008.
12. P. Indyk. Explicit constructions for compressed sensing of sparse signals. In SODA, pages 30-33, 2008.
13. R. Koetter and P. O. Vontobel. On the block error probability of LP decoding of LDPC codes. In Inaugural Workshop of the Center for Information Theory and its Applications, 2006. Available as eprint arXiv:cs/0602086v1.
14. T. Richardson and R. Urbanke. The capacity of low-density parity-check codes under message-passing decoding. IEEE Trans. on Info. Theory, 47(2), Feb. 2001.
15. H. D. Sherali and W. P. Adams. A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math., 3(3):411-430, 1990.
16. A. Shokrollahi. Ldpc codes: An introduction.
17. M. Sipser and D. Spielman. Expander codes. IEEE Trans. Info. Theory, 42:1710-1722, November 1996.
18. N. Wiberg. Codes and Decoding on General Graphs. PhD thesis, Linköoping University, Sweden, 1996.