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

Min Ho Shin, Joon Sung Kim, Hong Yeop Song

Research output: Contribution to journalConference article

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 languageEnglish
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
Publication statusPublished - 2004 Oct 20

Fingerprint

Quasi-cyclic Codes
LDPC Codes
Minimum Distance
Irregular
Parity
Lower bound
Design

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

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",
month = "10",
day = "20",
language = "English",
journal = "IEEE International Symposium on Information Theory - Proceedings",
issn = "2157-8095",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

Minimum distance bounds of irregular QC-LDPC codes and their applications. / Shin, Min Ho; Kim, Joon Sung; Song, Hong Yeop.

In: IEEE International Symposium on Information Theory - Proceedings, 20.10.2004.

Research output: Contribution to journalConference article

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/10/20

Y1 - 2004/10/20

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

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

SN - 2157-8095

ER -