Finite-length scaling of irregular LDPC code ensembles

Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005

Volumn , Issue , 2005, Pages 6-10

  Amraoui, Abdelaziz ^a   Montanari, Andrea ^b   Urbanke, Rüdiger ^a  

^a EPFL   (Switzerland)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; OPTIMIZATION;

BINARY ERASURE CHANNEL (BKC); CODE ENSEMBLES; FINITE-LENGTH CODES;

BINARY CODES;

EID: 33749050857     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.2005.1531845     Document Type: Conference Paper

References (6)

1. A. AMRAOUI, A. MONTANARI, T. RICHARDSON, AND R. URBANKE, Finite-length scaling for iteratively decoded ldpc ensembles. Submitted to IEEE Trans. on Inform. Theory, 2004. Available at http://lthcwww.epfl.ch/papers/AMRU04.ps
2. C. DI, D. PROIETTI, T. RICHARDSON, E. TELATAR, AND R. URBANKE, Finite length analysis of low-density parity-check codes on the binary erasure channel, IEEE Trans. Inform. Theory, 48 (2002), pp. 1570-1579.
3. M. LUBY, M. MlTZENMACHER, A. SHOKROLLAHI, D. SPIELMAN, AND V. STEMANN, Practical loss-resilient codes, in Proceedings of the 29th annual ACM Symposium on Theory of Computing, 1997, pp. 150-1.59.
4. T. RICHARDSON AND R. URBANKE, Finite-length density evolution and the distribution of the number of iterations for the binary erasure channel. in preparation, 2003.
5. J. ZHANG AND A. ORLITSKY, Finite-length analysis of LDPC codes with large left degrees, in IEEE International Symposium on Information Theory, Lausanne, Switzerland, June 30-July 5 2002, p. 3.
6. T. RICHARDSON AND R. URBANKE, Modern Coding Theory, preprint available online at http://lthcwww.epfl.ch/mct/