By Topic

Distance properties of irregular LDPC codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Lehmann, F. ; Inst. Nat. Polytech. de Grenoble, France

In this paper, we investigate the distance properties of irregular LDPC codes using the ensemble construction proposed by Richardson et al (Ref. 2). By generalizing the method introduced by Gallager for regular LDPC codes [R.G. Gallager, 1963], 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.

Published in:

Information Theory, 2003. Proceedings. IEEE International Symposium on

Date of Conference:

29 June-4 July 2003