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.
|Number of pages||1|
|Journal||IEEE International Symposium on Information Theory - Proceedings|
|State||Published - 2002|
|Event||2002 IEEE International Symposium on Information Theory - Lausanne, Switzerland|
Duration: 30 Jun 2002 → 5 Jul 2002