Non-linear programming approaches to decoding low-density parity-check codes

43rd Annual Allerton Conference on Communication, Control and Computing 2005

Volumn 2, Issue , 2005, Pages 1106-1115

  Yang, Kai ^a   Wang, Xiaodong ^a   Feldman, Jon ^b  

^a Columbia University ^*  (United States)

^b Och Spine at New York Presbyterian Hospitals   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84962130490     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. C. Berrou, and A. Glavieux, "Near optimum error correcting coding and decoding: Turbo-codes, " IEEE Trans. Communications, vol. 44, pp. 1261-1271, Oct. 1996.
2. R. Gallager, " Low-density parity-check codes, " IRE Trans. Inform. Theory, vol. 8, pp. 21-28, Jan. 1962.
3. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacity-approaching irregular lowdensity parity-check codes, " IEEE Trans. In-form. Theory, vol. 47, pp. 619637, Feb. 2001.
4. T. Richardson and R. Urbanke, "The capacity of low-density parity check codes under messagepassing decoding, " IEEE Trans. Inform. Theory, vol. 47, pp. 599618, Feb. 2001.
5. F.R. Kschischang, B.J. Frey, and H.A. Loeliger, "Factor graphs and the sum-product algorithm, " IEEE Trans. Inform. Theory, vol. 2, pp. 498-519, Feb. 2001.
6. J. Feldman, "Decoding error-correcting codes via linear programming, " Ph.D. dissertation, Massachusetts Institute of Technology, 2003.
7. J. Feldman, D. R. Karger, M. J. Wainwright, "Using Linear programming-based decoding of turbo-like codes and its relation to iterative approaches, " in Proc. 40th annual Conference on Communication, Control, and Computing, Oct. 2002.
8. J. Feldman, D. R. Karger, M. J. Wainwright, "Using Linear Programming to Decode Linear Codes, " in Proc. 37th annual Conference on Information Sciences and Systems, Mar. 2003.
9. R. Koetter and P. O. Vontobel, "Graph-covers and iterative decoding of finite length codes, " in Proc. 3rd International Symposium on Turbo Codes, September 2003.
10. P.O. Vontobel and R. Koetter, "On the relationship between linear programming decoding and min-sum algorithm decoding" in Proc. International Symposium on Information Theory and its Applications, Oct. 2004.
11. J. Pearl, "Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, " Morgan Kaufmann Publishers, 1988.
12. D. Bertsimas and J.N. Tsitsiklis, "Introduction to Linear Optimization, " Athena Scientific, 1997.
13. B. N. Vellambi and F. Fekri, "On stopping sets and an improved decoding algorithm for lowdensity parity-check codes over the binary erasure channel, " in Proc. 42th annual Conference on Communication, Control, and Computing, Sep. 2004.
14. M. J. Wainwright, T. S. Jaakkola and A. S. Willsky, "MAP estimation via agreement on (hyper) trees: Message-passing and linear programming approaches" in Proc. 40th Annual Allerton Conf. on Communication, Control, and Computing, Oct. 2002.
15. J. Feldman and M. J.Wainwright and D. R. Karger, "Using Linear Programming to Decode Binary Linear Codes, " IEEE Trans. on Information Theory, 51(3), Mar. 2005.
16. D. Bertsimas and J.N. Tsitsiklis, "Parallel and Distributed Computation: Numerical Methods , " Athena Scientific, 1997.
17. COIN-OR COmputational INfrastructure for Operations Research http://www.coin-or.org/
18. J. Pursley, "Turbo Product Codes and Channel Capacity, " http://www.clemson.edu/sure/projects/jpursley secon01.pdf