Improved Linear Programming Decoding of LDPC Codes and Bounds on the Minimum and Fractional Distance

IEEE Transactions on Information Theory ◽

10.1109/tit.2011.2162224 ◽

2011 ◽

Vol 57 (11) ◽

pp. 7386-7402 ◽

Author(s):

David Burshtein ◽

Idan Goldenberg

Keyword(s):

Linear Programming ◽

Linear Programming Decoding ◽

Fractional Distance

Download Full-text

Modified multistage linear programming decoding of LDPC codes

2011 IEEE 13th International Conference on Communication Technology ◽

10.1109/icct.2011.6157842 ◽

2011 ◽

Author(s):

Xian Zhang ◽

Piming Ma

Keyword(s):

Linear Programming ◽

Linear Programming Decoding ◽

Multistage Linear Programming

Download Full-text

Reduced-Complexity Linear Programming Decoding Based on ADMM for LDPC Codes

IEEE Communications Letters ◽

10.1109/lcomm.2015.2418261 ◽

2015 ◽

Vol 19 (6) ◽

pp. 909-912 ◽

Author(s):

Haoyuan Wei ◽

Xiaopeng Jiao ◽

Jianjun Mu

Keyword(s):

Linear Programming ◽

Linear Programming Decoding ◽

Reduced Complexity

Download Full-text

On low-complexity linear-programming decoding of LDPC codes

European Transactions on Telecommunications ◽

10.1002/ett.1184 ◽

2007 ◽

Vol 18 (5) ◽

pp. 509-517 ◽

Author(s):

Pascal O. Vontobel ◽

Ralf Koetter

Keyword(s):

Linear Programming ◽

Low Complexity ◽

Linear Programming Decoding

Download Full-text

An Iterative Joint Linear-Programming Decoding of LDPC Codes and Finite-State Channels

2011 IEEE International Conference on Communications (ICC) ◽

10.1109/icc.2011.5962814 ◽

2011 ◽

Author(s):

Byung-Hak Kim ◽

Henry D. Pfister

Keyword(s):

Linear Programming ◽

Linear Programming Decoding ◽

Download Full-text

Improved linear programming decoding and bounds on the minimum distance of LDPC codes

2010 IEEE Information Theory Workshop ◽

10.1109/cig.2010.5592887 ◽

2010 ◽

Author(s):

David Burshtein ◽

Idan Goldenberg

Keyword(s):

Linear Programming ◽

Minimum Distance ◽

Linear Programming Decoding

Download Full-text

Iterative Approximate Linear Programming Decoding of LDPC Codes With Linear Complexity

IEEE Transactions on Information Theory ◽

10.1109/tit.2009.2030477 ◽

2009 ◽

Vol 55 (11) ◽

pp. 4835-4859 ◽

Author(s):

David Burshtein

Keyword(s):

Linear Programming ◽

Linear Complexity ◽

Linear Programming Decoding ◽

Approximate Linear Programming

Download Full-text

Iterative approximate linear programming decoding of LDPC codes with linear complexity

2008 IEEE International Symposium on Information Theory ◽

10.1109/isit.2008.4595237 ◽

2008 ◽

Author(s):

David Burshtein

Keyword(s):

Linear Programming ◽

Linear Complexity ◽

Linear Programming Decoding ◽

Approximate Linear Programming

Download Full-text

Infeasible primal-dual interior-point algorithm for linear-programming decoding of LDPC codes

2011 IEEE 13th International Conference on Communication Technology ◽

10.1109/icct.2011.6157843 ◽

2011 ◽

Author(s):

Xuye Wang ◽

Piming Ma

Keyword(s):

Linear Programming ◽

Interior Point ◽

Interior Point Algorithm ◽

Linear Programming Decoding ◽

Download Full-text

Iterative Linear Programming Decoding of Nonbinary LDPC Codes With Linear Complexity

IEEE Transactions on Information Theory ◽

10.1109/tit.2012.2211859 ◽

2013 ◽

Vol 59 (1) ◽

pp. 282-300 ◽

Author(s):

Dina Goldin ◽

David Burshtein

Keyword(s):

Linear Programming ◽

Linear Complexity ◽

Linear Programming Decoding ◽

Nonbinary Ldpc Codes

Download Full-text

On the Decomposition Method for Linear Programming Decoding of LDPC Codes

IEEE Transactions on Communications ◽

10.1109/tcomm.2010.102910.090490 ◽

2010 ◽

Vol 58 (12) ◽

pp. 3448-3458 ◽

Author(s):

Haiyang Liu ◽

Wenze Qu ◽

Bin Liu ◽

Jie Chen

Keyword(s):

Linear Programming ◽

Decomposition Method ◽

Linear Programming Decoding

Download Full-text