Tree-based construction of LDPC codes

Deepak Sridhara, Christine Kelley, Joachim Rosenthal

Research output: Contribution to journalConference articlepeer-review

2 Scopus citations


We present a construction of LDPC codes that have minimum pseudocodeword weight equal to the minimum distance, and perform well with iterative decoding. The construction involves enumerating a d-regular tree for a fixed number of layers and employing a connection algorithm based on mutually orthogonal Latin squares to close the tree. Methods are presented for degrees d = ps and d = ps + 1, for p a prime, - one of which includes the well-known finite-geometry-based LDPC codes.

Original languageEnglish (US)
Article number1523456
JournalIEEE International Symposium on Information Theory - Proceedings
StatePublished - 2005
Externally publishedYes
Event2005 IEEE International Symposium on Information Theory, ISIT 05 - Adelaide, Australia
Duration: Sep 4 2005Sep 9 2005

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics


Dive into the research topics of 'Tree-based construction of LDPC codes'. Together they form a unique fingerprint.

Cite this