Enumerators for protograph ensembles of LDPC codes

IEEE International Symposium on Information Theory - Proceedings

Volumn 2005, Issue , 2005, Pages 2156-2160

  Fogal, S L ^a   McEliece, Robert ^a   Thorpe, Jeremy ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LOCAL MAXIMA; PARTIAL WEIGHT ENUMERATORS; QUASI-CYCLIC CODES;

OPTIMIZATION; PROBABILITY; PROBLEM SOLVING;

CODES (SYMBOLS);

EID: 33746581975     PISSN: 21578099     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2005.1523728     Document Type: Conference Paper

References (10)

1. C. Di, D. Proietti, E. Telatar, T. Richardson, and R. Urbanke, "Finite length analysis of low-density parity-check codes." Submitted IEEE Trans. on Information Theory, 2001.
2. B. J. Frey, R. Koetter, and A. Vardy, "Skewness and pseudocodewords in iterative decoding,"
3. T. Richardson, "Error floors of Idpc codes." 2004.
4. R. Gallager, "Low-density parity-check codes."
5. S. Litsyn and V. Shevelev, "On ensembles of low-density paritycheck codes: Asymptotic distance distributions.," IEEE Transactions on Information Theory, vol. 48, no. 4, pp. 887-908, 2002.
6. C. Di, "Asymptotic and finite-length analysis of low-density parity-check codes," 2004.
7. T. Cover and J. Thomas, Elements of Information Theory. Wiley Interscience, 1991.
8. S. Aji, S. Fogal, R. McEliece, and B. Wang, "Constrained entropy, free energy, and the legendre transform," 2005. Submitted to International Symposium on Information Theory.
9. J. Nocedal and S. J. Wright, Numerical Optimization. Springer-Verlag, 1999.
10. R. M. Tanner, "On graph constructions for Idpc codes by quasicyclic extension," in Information, Coding and Mathematics (M. Blaum, P. Farrell, and H. van Tilborg, eds.), pp. 209-220, Kluwer, June 2002.