TY - GEN
T1 - LP decoding of regular LDPC codes in memoryless channels
AU - Halabi, Nissim
AU - Even, Guy
PY - 2010
Y1 - 2010
N2 - We study error bounds for linear programming decoding of regular LDPC codes. For memoryless binary-input output-symmetric channels, we prove bounds on the word error probability that are inverse doubly-exponential in the girth of the factor graph. For memoryless binary-input AWGN channels, we derive lower bounds on the thresholds for regular LDPC codes under LP decoding. Specifically, we prove a lower bound of σ = 0.735 on the threshold of (3, 6)-regular LDPC codes with logarithmic girth.
AB - We study error bounds for linear programming decoding of regular LDPC codes. For memoryless binary-input output-symmetric channels, we prove bounds on the word error probability that are inverse doubly-exponential in the girth of the factor graph. For memoryless binary-input AWGN channels, we derive lower bounds on the thresholds for regular LDPC codes under LP decoding. Specifically, we prove a lower bound of σ = 0.735 on the threshold of (3, 6)-regular LDPC codes with logarithmic girth.
UR - http://www.scopus.com/inward/record.url?scp=77955689455&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2010.5513612
DO - 10.1109/ISIT.2010.5513612
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:77955689455
SN - 9781424469604
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 744
EP - 748
BT - 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings
T2 - 2010 IEEE International Symposium on Information Theory, ISIT 2010
Y2 - 13 June 2010 through 18 June 2010
ER -