Distance properties of irregular LDPC codes

Frederic Lehmann

doi:10.1109/isit.2003.1228099

Distance properties of irregular LDPC codes

Frederic Lehmann

GPM2-INPG

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

Abstract

In this paper, we investigate the distance properties of irregular LDPC codes using the ensemble construction proposed by Richardson et al [2]. By generalizing the method introduced by Gallager for regular LDPC codes [1], we calculate the average weight distribution of irregular LDPC codes. Then, we interpret the stability condition of density evolution as a sufficient condition so that the error probability due to low weight codewords tends to zero under maximum-likelihood decoding.

Original language	English
Pages (from-to)	85
Number of pages	1
Journal	IEEE International Symposium on Information Theory-Proceedings
DOIs	https://doi.org/10.1109/isit.2003.1228099
Publication status	Published - 1 Jan 2003
Externally published	Yes
Event	Proceedings 2003 IEEE International Symposium on Information Theory (ISIT) - Yokohama, Japan Duration: 29 Jun 2003 → 4 Jul 2003

Access to Document

10.1109/isit.2003.1228099

Cite this

@article{d79d227f50e54125ac9c4586233d3db1,

title = "Distance properties of irregular LDPC codes",

abstract = "In this paper, we investigate the distance properties of irregular LDPC codes using the ensemble construction proposed by Richardson et al [2]. By generalizing the method introduced by Gallager for regular LDPC codes [1], we calculate the average weight distribution of irregular LDPC codes. Then, we interpret the stability condition of density evolution as a sufficient condition so that the error probability due to low weight codewords tends to zero under maximum-likelihood decoding.",

author = "Frederic Lehmann",

year = "2003",

month = jan,

day = "1",

doi = "10.1109/isit.2003.1228099",

language = "English",

pages = "85",

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

issn = "2157-8095",

note = "Proceedings 2003 IEEE International Symposium on Information Theory (ISIT) ; Conference date: 29-06-2003 Through 04-07-2003",

}

TY - JOUR

T1 - Distance properties of irregular LDPC codes

AU - Lehmann, Frederic

PY - 2003/1/1

Y1 - 2003/1/1

N2 - In this paper, we investigate the distance properties of irregular LDPC codes using the ensemble construction proposed by Richardson et al [2]. By generalizing the method introduced by Gallager for regular LDPC codes [1], we calculate the average weight distribution of irregular LDPC codes. Then, we interpret the stability condition of density evolution as a sufficient condition so that the error probability due to low weight codewords tends to zero under maximum-likelihood decoding.

AB - In this paper, we investigate the distance properties of irregular LDPC codes using the ensemble construction proposed by Richardson et al [2]. By generalizing the method introduced by Gallager for regular LDPC codes [1], we calculate the average weight distribution of irregular LDPC codes. Then, we interpret the stability condition of density evolution as a sufficient condition so that the error probability due to low weight codewords tends to zero under maximum-likelihood decoding.

U2 - 10.1109/isit.2003.1228099

DO - 10.1109/isit.2003.1228099

M3 - Conference article

AN - SCOPUS:0141904733

SN - 2157-8095

SP - 85

JO - IEEE International Symposium on Information Theory-Proceedings

JF - IEEE International Symposium on Information Theory-Proceedings

T2 - Proceedings 2003 IEEE International Symposium on Information Theory (ISIT)

Y2 - 29 June 2003 through 4 July 2003

ER -

Distance properties of irregular LDPC codes

Abstract

Access to Document

Fingerprint

Cite this