DocumentCode
2001819
Title
Distance properties of irregular LDPC codes
Author
Lehmann, Frederic
Author_Institution
Inst. Nat. Polytech. de Grenoble, France
fYear
2003
fDate
29 June-4 July 2003
Firstpage
85
Abstract
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.
Keywords
error statistics; maximum likelihood decoding; parity check codes; average weight distribution calculation; distance property; ensemble construction; error probability; irregular LDPC code; low weight codeword; maximum-likelihood decoding; stability condition; AWGN; Equations; Error probability; Joining processes; Maximum likelihood decoding; Message passing; Parity check codes; Polynomials; Stability; Sufficient conditions;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2003. Proceedings. IEEE International Symposium on
Print_ISBN
0-7803-7728-1
Type
conf
DOI
10.1109/ISIT.2003.1228099
Filename
1228099
Link To Document