Decomposition methods for large scale LP decoding

2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011

Volumn , Issue , 2011, Pages 253-260

  Barman, Siddharth ^a   Liu, Xishuo ^b   Draper, Stark ^b   Recht, Benjamin ^a  

^a University of Wisconsin   (United States)

^b University of Wisconsin Madison   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK LENGTHS; BP DECODER; DECOMPOSITION METHODS; ERROR CORRECTING CODE; LINEAR ERROR-CORRECTING CODES; LINEAR-TIME ALGORITHMS; LP DECODING; OPTIMIZATION THEORY; POLYTOPES;

ALGORITHMS; BIT ERROR RATE; COMMUNICATION; SITE SELECTION;

DECODING;

EID: 84862926868     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/Allerton.2011.6120176     Document Type: Conference Paper

References (12)

1. S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein. Distributed optimization and statistical learning via the alternating direction method of multipliers. Machine Learning, 3(1):1-123, 2010.
2. D. Burshtein. Iterative approximate linear programming decoding of LDPC codes with linear complexity. Information Theory, IEEE Transactions on, 55(11):4835-4859, 2009.
3. S.C. Draper, J.S. Yedidia, and Y. Wang. ML decoding via mixed-integer adaptive linear programming. In Information Theory, 2007. ISIT 2007. IEEE International Symposium on, pages 1656-1660. IEEE, 2007.
4. J. Feldman, M.J. Wainwright, and D.R. Karger. Using linear programming to decode binary linear codes. Information Theory, IEEE Transactions on, 51(3):954-972, 2005. (Pubitemid 40377560)
5. M.D. Gupta, S. Kumar, and J. Xiao. L1 projections with box constraints. Arxiv preprint arXiv:1010.0141, 2010.
6. RG Jeroslow. On defining sets of vertices of the hypercube by linear inequalities. Discrete Mathematics, 11(2):119-124, 1975.
7. A.W. Marshall, I. Olkin, and Arnold B.C. Inequalities: theory of majorization and its applications. Springer, 2009.
8. M.H.N. Taghavi and P.H. Siegel. Adaptive methods for linear programming decoding. Information Theory, IEEE Transactions on, 54(12):5396-5410, 2008.
9. R. M. Tanner, D. Sridhara, and T. Fuja. A class of group-structured LDPC codes. In Proc. ICSTA, Ambleside, UK, 2001.
10. P.O. Vontobel and R. Koetter. On low-complexity linear-programming decoding of LDPC codes. European transactions on telecommunications, 18(5):509-517, 2007.
11. M. Yannakakis. Expressing combinatorial optimization problems by linear programs. Journal of Computer and System Sciences, 43(3):441-466, 1991.
12. J.S. Yedidia, Y. Wang, and S.C. Draper. Divide and concur and difference-map BP decoders for LDPC codes. IEEE Transactions on Information Theory, 57(2):786-802, 2011.