How to find good finite-length codes: From art towards science

European Transactions on Telecommunications

Volumn 18, Issue 5, 2007, Pages 491-508

  Amraoui, Abdelaziz ^a   Montanari, Andrea ^b,c   Urbanke, Ruediger ^a  

^a EPFL   (Switzerland)

^b ECOLE NORMALE SUPÉRIEURE   (France)

^c STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY CODES; CHANNEL ESTIMATION; COMPUTER SIMULATION; ERROR DETECTION;

BINARY ERASURE CHANNELS; FINITE LENGTH CODES; FINITE LENGTH SCALING;

CHANNEL CODING;

EID: 34547692699     PISSN: 1124318X     EISSN: None     Source Type: Journal    
DOI: 10.1002/ett.1182     Document Type: Conference Paper

References (7)

1. Richardson T, Urbanke R. Modern Coding Theory. Cambridge University Press, 2006. In preparation.
2. Montanari A. Finite-size scaling of good codes. In Proceedings of 39th Annual Allerton Conference on Communication, Control and Computing,Monticello, IL, 2001.
3. Amraoui A, Montanari A, Richardson T, Urbanke R. Finite-length scaling for iteratively decoded ldpcensembles. Submitted to IEEE IT, June 2004.
4. Amraoui A, Montanari A, Richardson T, Urbanke R. Finite-length scaling and finite-length shift for low-density parity-check codes. In Proceedings of 42th Annual Allerton Conference on Communication, Control and Computing,Monticello, IL, 2004.
5. Amraoui A, Montanari A, Urbanke R. Finite-length scaling of irregular LDPC code ensembles. In Proceedings of IEEE Information Theory Workshop,Rotorua, New-Zealand, August-September 2005.
6. Luby M, Mitzenmacher M, Shokrollahi A, Spielman DA, Stemann V. Practical loss-resilient codes. In Proceedings of the 29th annual ACM Symposium on Theory of Computing,pages 150-159, 1997.
7. Méasson C, Montanari A, Urbanke R. Maxwell's construction: the hidden bridge between maximum-likelihood and iterative decoding. Submitted to IEEE Transactions on Information Theory, 2005.