Detailed representation of irregular LDPC code ensembles and density evolution

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2003, Pages 121-

  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

ENCODING (SYMBOLS); ITERATIVE METHODS; MATHEMATICAL MODELS; MAXIMUM PRINCIPLE;

DENSITY EVOLUTION; LOW DENSITY PARITY CHECK CODE;

CODES (SYMBOLS);

EID: 0141939050     PISSN: 21578096     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/isit.2003.1228135     Document Type: Conference Paper

References (3)

1. M. Luby, M. Mitzenmacher, A. Shokrollahi and D. Spielman, "Improved Lowd-Density Parity-Check Codes Using Irregular Graphs," IEEE Trans. Inform. Theory, vol. 47, pp.585-598, Feb. 2001.
2. T. Richardson, A. Shokrollahi and R. Urbanke, "Design of Capacity-Approaching Irregular Low-Density Parity-Check Codes," IEEE Trans. Inform. Theory, vol.47, pp.619-637, Feb. 2001.
3. A. Amraoui, "LdpcOpt", http://lthcwww.epfl.ch/research/ldpcopt/