Asymptotic weight and stopping set distributions for detailedly represented irregular LDPC code ensembles

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2004, Pages 208-

  Ikegaya, Ryoji ^a   Kasai, Kenta ^a   Shibuya, Tomoharu ^b   Sakaniwa, Kohichi ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^b NATIONAL INSTITUTE OF MULTIMEDIA EDUCATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

JOINT DEGREE DISTRIBUTION; LOW-DENSITY PARITY CHECK (LDPC); WEIGHT DISTRIBUTION;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ERROR ANALYSIS; PROBABILITY; SET THEORY; THEOREM PROVING;

CODES (STANDARDS);

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

References (5)

1. D. Burshtein and G. Miller, "Asymptotic enumeration methods for analyzing LDPC codes," submitted to IEEE Trans. Inform. Theory, 2002.
2. K. Kasai, T. Shibuya and K. Sakaniwa, "Detailedly Represented Irregular Low-Density Parity-Check Codes," IEICE Trans. on Fundamentals, vol.E86-A, no.10, pp.2435-2444, 2003.
3. G. Miller and D. Burshtein, "Bounds on the Maximum-Likelihood Decoding Error Probability of Low-Density Parity-Check Codes," IEEE Trans. Inform. Theory, vol.47, pp.2696-2710, Nov. 2001.
4. A. Orlitsky, K. Yiswanathan and J. Zhang, "Stopping Set Distribution of LDPC Code Ensembles," Proc. of ISIT2003. p. 123, 2003.
5. T. Richardson, A. Shokrollahi and R. Urbanke, "The capacity of Low-density parity-check codes under message passing decoding," IEEE Trans. Inform. Theory, vol.47, pp.599-618, Feb. 2001.