Minimum distance bounds of irregular QC-LDPC codes and their applications

Min Ho Shin; Joon Sung Kim; Hong Yeop Song

Minimum distance bounds of irregular QC-LDPC codes and their applications

Min Ho Shin, Joon Sung Kim, Hong Yeop Song

Department of Electrical and Electronic Engineering

Research output: Contribution to journal › Conference article › peer-review

2 Citations (Scopus)

Abstract

We consider a design of quasi-cyclic LDPC codes which have irregular column weights. We derive bit-oriented bound and parity-oriented bound on the minimum distances of irregular quasi-cyclic codes using a similar technique to Tanner's simple lower bound.

Original language	English
Pages (from-to)	312
Number of pages	1
Journal	IEEE International Symposium on Information Theory - Proceedings
Publication status	Published - 2004
Event	Proceedings - 2004 IEEE International Symposium on Information Theory - Chicago, IL, United States Duration: 2004 Jun 27 → 2004 Jul 2

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modelling and Simulation
Applied Mathematics

Cite this

@article{570a2d41ba3a4efcb948f924ba49aa16,

title = "Minimum distance bounds of irregular QC-LDPC codes and their applications",

abstract = "We consider a design of quasi-cyclic LDPC codes which have irregular column weights. We derive bit-oriented bound and parity-oriented bound on the minimum distances of irregular quasi-cyclic codes using a similar technique to Tanner's simple lower bound.",

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

year = "2004",

language = "English",

pages = "312",

journal = "IEEE International Symposium on Information Theory - Proceedings",

issn = "2157-8095",

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

note = "Proceedings - 2004 IEEE International Symposium on Information Theory ; Conference date: 27-06-2004 Through 02-07-2004",

}

TY - JOUR

T1 - Minimum distance bounds of irregular QC-LDPC codes and their applications

AU - Shin, Min Ho

AU - Kim, Joon Sung

AU - Song, Hong Yeop

PY - 2004

Y1 - 2004

N2 - We consider a design of quasi-cyclic LDPC codes which have irregular column weights. We derive bit-oriented bound and parity-oriented bound on the minimum distances of irregular quasi-cyclic codes using a similar technique to Tanner's simple lower bound.

AB - We consider a design of quasi-cyclic LDPC codes which have irregular column weights. We derive bit-oriented bound and parity-oriented bound on the minimum distances of irregular quasi-cyclic codes using a similar technique to Tanner's simple lower bound.

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

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

M3 - Conference article

AN - SCOPUS:5044245410

SN - 2157-8095

SP - 312

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

T2 - Proceedings - 2004 IEEE International Symposium on Information Theory

Y2 - 27 June 2004 through 2 July 2004

ER -

Minimum distance bounds of irregular QC-LDPC codes and their applications

Abstract

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this