Analysis of an algorithm for irregular LDPC code construction

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2004, Pages 69-

  Ramamoorthy, Aditya ^a   Wesel, Richard D ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACE-CONSTRAINED CODES; APPROXIMATE CYCLE EXTRINSIC MESSAGE DEGREE (ACE); RANDOM CODES; STOPPING SET ANALYSIS;

ALGORITHMS; COMPUTATIONAL METHODS; ERROR CORRECTION; PARAMETER ESTIMATION; SET THEORY; THEOREM PROVING;

CODES (SYMBOLS);

EID: 5044246143     PISSN: 21578097     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (3)

1. T. Tian, C. Jones, J. D. Villasenor, and R. D. Wesel, "Construction of Irregular LDPC Codes with Low Error Floors," in IEEE Intl. Conf. on Comm., 2003, pp. 3125-3129
2. A. Orlitsky, K. Viswanathan, and J. Zhang, "Stopping Set Distribution of LDPC Code Ensembles," in IEEE Intl. Symposium on Info. Th., 2003, pp. 123-123
3. D. Burshtein and G. Miller, "Asymptotic Enumeration Methods for analyzing LDPC Codes," Submitted to IEEE Trans. on Info. Th.