Generalization of Tanner's minimum distance bounds for LDPC codes

Min Ho Shin; Joon Sung Kim; Hong Yeop Song

doi:10.1109/LCOMM.2005.03002

Generalization of Tanner's minimum distance bounds for LDPC codes

Min Ho Shin, Joon Sung Kim, Hong Yeop Song

Department of Electrical and Electronic Engineering

Research output: Contribution to journal › Article › peer-review

7 Citations (Scopus)

Abstract

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 language	English
Pages (from-to)	240-242
Number of pages	3
Journal	IEEE Communications Letters
Volume	9
Issue number	3
DOIs	https://doi.org/10.1109/LCOMM.2005.03002
Publication status	Published - 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

Access to Document

10.1109/LCOMM.2005.03002

Cite this

@article{5a9e5cec2eaa437d97ae6231e817086f,

title = "Generalization of Tanner's minimum distance bounds for LDPC codes",

abstract = "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.",

author = "Shin, {Min Ho} and Kim, {Joon Sung} and Song, {Hong Yeop}",

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{\textquoteright}04.",

year = "2005",

month = mar,

doi = "10.1109/LCOMM.2005.03002",

language = "English",

volume = "9",

pages = "240--242",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "3",

}

TY - JOUR

T1 - Generalization of Tanner's minimum distance bounds for LDPC codes

AU - Shin, Min Ho

AU - Kim, Joon Sung

AU - Song, Hong Yeop

N1 - 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.

PY - 2005/3

Y1 - 2005/3

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=15744363446&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=15744363446&partnerID=8YFLogxK

U2 - 10.1109/LCOMM.2005.03002

DO - 10.1109/LCOMM.2005.03002

M3 - Article

AN - SCOPUS:15744363446

SN - 1089-7798

VL - 9

SP - 240

EP - 242

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 3

ER -

Generalization of Tanner's minimum distance bounds for LDPC codes

Abstract

Bibliographical note

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this