TY - JOUR
T1 - Upper bounds on the rate of LDPC codes
AU - Burshtein, David
AU - Krivelevich, Michael
AU - Litsyn, Simon
AU - Miller, Gadi
PY - 2002
Y1 - 2002
N2 - The upper bounds on the rate of individual low-density parity check (LDPC) codes and ensembles of codes operating over an arbitrary binary-input symmetric-output channel were calculated. The theorems defining the necessary conditions for reliable communication were proved, both for binary codes and ensembles of parity check codes. The bounds depicted an improvement over the conventional Hamming bounds.
AB - The upper bounds on the rate of individual low-density parity check (LDPC) codes and ensembles of codes operating over an arbitrary binary-input symmetric-output channel were calculated. The theorems defining the necessary conditions for reliable communication were proved, both for binary codes and ensembles of parity check codes. The bounds depicted an improvement over the conventional Hamming bounds.
UR - http://www.scopus.com/inward/record.url?scp=0036350950&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???
AN - SCOPUS:0036350950
SN - 2157-8095
SP - 28
JO - IEEE International Symposium on Information Theory - Proceedings
JF - IEEE International Symposium on Information Theory - Proceedings
T2 - 2002 IEEE International Symposium on Information Theory
Y2 - 30 June 2002 through 5 July 2002
ER -