TY - GEN
T1 - Improved linear programming decoding and bounds on the minimum distance of LDPC codes
AU - Burshtein, David
AU - Goldenberg, Idan
PY - 2010
Y1 - 2010
N2 - We propose a technique for improving LP decoding, based on the merging of check nodes. This technique can be applied to standard as well as generalized LDPC codes. Furthermore, we show how a recently-discovered linear-complexity LP decoder can be used to derive non-trivial lower bounds on the minimum distance of specific LDPC codes, with complexity that exhibits quadratic growth with respect to the block length. This bound can be refined using the check node merging technique. The lower bound on the minimum distance is shown to be an upper bound on the fractional distance of the code.
AB - We propose a technique for improving LP decoding, based on the merging of check nodes. This technique can be applied to standard as well as generalized LDPC codes. Furthermore, we show how a recently-discovered linear-complexity LP decoder can be used to derive non-trivial lower bounds on the minimum distance of specific LDPC codes, with complexity that exhibits quadratic growth with respect to the block length. This bound can be refined using the check node merging technique. The lower bound on the minimum distance is shown to be an upper bound on the fractional distance of the code.
KW - Linear programming decoding
KW - iterative decoding
KW - low-density parity-check (LDPC) codes
KW - maximum likelihood (ML) decoding
UR - http://www.scopus.com/inward/record.url?scp=80051943551&partnerID=8YFLogxK
U2 - 10.1109/CIG.2010.5592887
DO - 10.1109/CIG.2010.5592887
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:80051943551
SN - 9781424482641
T3 - 2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings
BT - 2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings
T2 - 2010 IEEE Information Theory Workshop, ITW 2010
Y2 - 30 August 2010 through 3 September 2010
ER -