Generalization of Tanner's minimum distance bounds for LDPC codes

Min Ho Shin, Joon Sung Kim, Hong Yeop Song

Research output: Contribution to journalArticle

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 languageEnglish
Pages (from-to)240-242
Number of pages3
JournalIEEE Communications Letters
Volume9
Issue number3
DOIs
Publication statusPublished - 2005 Mar 1

Fingerprint

LDPC Codes
Minimum Distance
Adjacency Matrix
Parity
Irregular
Eigenvalue
Generalise
Graph in graph theory
Generalization

All Science Journal Classification (ASJC) codes

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

Cite this

Shin, Min Ho ; Kim, Joon Sung ; Song, Hong Yeop. / Generalization of Tanner's minimum distance bounds for LDPC codes. In: IEEE Communications Letters. 2005 ; Vol. 9, No. 3. pp. 240-242.
@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}",
year = "2005",
month = "3",
day = "1",
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",

}

Generalization of Tanner's minimum distance bounds for LDPC codes. / Shin, Min Ho; Kim, Joon Sung; Song, Hong Yeop.

In: IEEE Communications Letters, Vol. 9, No. 3, 01.03.2005, p. 240-242.

Research output: Contribution to journalArticle

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

PY - 2005/3/1

Y1 - 2005/3/1

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

VL - 9

SP - 240

EP - 242

JO - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

IS - 3

ER -