TY - GEN
T1 - On upper bounds for the achievable rates of LDPC codes
AU - Presman, Noam
AU - Litsyn, Simon
PY - 2009/12/7
Y1 - 2009/12/7
N2 - Upper bounds on the mutual entropy of syndrome components of low-density parity-check (LDPC) codes are developed. Using these bounds, an upper bound is derived on the rates of LDPC codes for which reliable communication over a memoryless binary-input symmetric-output (MBIOS) channel is achievable. This bound improves on the earlier known bounds due to Gallager, Burshtein et al., and Weichmann-Sason.
AB - Upper bounds on the mutual entropy of syndrome components of low-density parity-check (LDPC) codes are developed. Using these bounds, an upper bound is derived on the rates of LDPC codes for which reliable communication over a memoryless binary-input symmetric-output (MBIOS) channel is achievable. This bound improves on the earlier known bounds due to Gallager, Burshtein et al., and Weichmann-Sason.
UR - http://www.scopus.com/inward/record.url?scp=76249096215&partnerID=8YFLogxK
U2 - 10.1109/ITW.2009.5351232
DO - 10.1109/ITW.2009.5351232
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:76249096215
SN - 9781424449835
T3 - 2009 IEEE Information Theory Workshop, ITW 2009
SP - 21
EP - 25
BT - 2009 IEEE Information Theory Workshop, ITW 2009
T2 - 2009 IEEE Information Theory Workshop, ITW 2009
Y2 - 11 October 2009 through 16 October 2009
ER -