Upper bounds on the rate of LDPC codes as a function of minimum distance

Yael Ben-Haim, Simon Litsyn

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

New upper bounds on the rate of low-density parity-check (LDPC) codes as a function of the minimum distance of the code are derived. These bounds are based on combinatorial arguments and linear programming. They improve on the previous bounds due to Burshtein et al. It is proved that at least for high rates LDPC codes have worse relative minimum distance than the one guaranteed by the Gilbert-Varshamov bound.

Original languageEnglish
Title of host publicationProceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 05
Pages47-51
Number of pages5
DOIs
StatePublished - 2005
Event2005 IEEE International Symposium on Information Theory, ISIT 05 - Adelaide, Australia
Duration: 4 Sep 20059 Sep 2005

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2005
ISSN (Print)2157-8099

Conference

Conference2005 IEEE International Symposium on Information Theory, ISIT 05
Country/TerritoryAustralia
CityAdelaide
Period4/09/059/09/05

Fingerprint

Dive into the research topics of 'Upper bounds on the rate of LDPC codes as a function of minimum distance'. Together they form a unique fingerprint.

Cite this