DocumentCode
2050421
Title
Finite-length analysis of LDPC codes with large left degrees
Author
Zhang, Junan ; Orlitsky, Alon
Author_Institution
Dept. of Electr. & Comput. Eng., California Univ., San Diego, La Jolla, CA, USA
fYear
2002
fDate
2002
Firstpage
3
Abstract
Extending the results of Proietti et al. (see IEEE Trans. on Information Theory, vol.48, June 2002) we derive a recursion for calculating the average error probability of random bipartite graph ensembles of LDPC codes with large left degrees over erasure channels.
Keywords
error statistics; graph theory; parity check codes; LDPC codes; average error probability; erasure channels; finite-length analysis; large left degrees; random bipartite graph ensembles; Bipartite graph; Boundary conditions; Costs; Error probability; Iterative decoding; Parity check codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Print_ISBN
0-7803-7501-7
Type
conf
DOI
10.1109/ISIT.2002.1023275
Filename
1023275
Link To Document