Generalization of Tanner's minimum distance bounds for LDPC codes

Min Ho Shin, Joon Sung Kim, Hong Yeop Song

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)


Tanner derived minimum distance bounds of regular codes in terms of the eigenvalues of the adjacency matrix by using some graphical analysis on the associated graph of the code. In this letter, we generalize Tanner's results by deriving a bit-oriented bound and a parity-oriented bound on the minimum distances of both regular and block-wise irregular LDPC codes.

Original languageEnglish
Pages (from-to)240-242
Number of pages3
JournalIEEE Communications Letters
Issue number3
Publication statusPublished - 2005 Mar

Bibliographical note

Funding Information:
Manuscript received June 23, 2004. The associate editor coordinating the review of this letter and approving it for publication was Prof. Marc Fossorier. Support for this work was provided in part by Samsung Electronics under the project on 4G wireless communication systems. Part of this work was presented at ISIT’04.

All Science Journal Classification (ASJC) codes

  • Modelling and Simulation
  • Computer Science Applications
  • Electrical and Electronic Engineering


Dive into the research topics of 'Generalization of Tanner's minimum distance bounds for LDPC codes'. Together they form a unique fingerprint.

Cite this