Distance properties of irregular LDPC codes

Frederic Lehmann

doi:10.1109/isit.2003.1228099

Distance properties of irregular LDPC codes

Frederic Lehmann

GPM2-INPG

Résultats de recherche: Contribution à un journal › Article de conférence › Revue par des pairs

Résumé

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.

langue originale	Anglais
Pages (de - à)	85
Nombre de pages	1
journal	IEEE International Symposium on Information Theory-Proceedings
Les DOIs	https://doi.org/10.1109/isit.2003.1228099
état	Publié - 1 janv. 2003
Modification externe	Oui
Evénement	Proceedings 2003 IEEE International Symposium on Information Theory (ISIT) - Yokohama, Japon Durée: 29 juin 2003 → 4 juil. 2003

Accès au document

10.1109/isit.2003.1228099

Autres fichiers et liens

Lien vers la publication dans Scopus

Contient cette citation

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

UR - https://www.scopus.com/pages/publications/0141904733

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

Résumé

Accès au document

Autres fichiers et liens

Empreinte digitale

Contient cette citation