Finite-length scaling of repeat-accumulate codes on the BEC

International Zurich Seminar on Digital Communications

Volumn , Issue , 2008, Pages 64-67

  Andriyanova, Iryna ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

LDPC CODING; LENGTH SCALING; REPEAT-ACCUMULATE CODES;

CODES (SYMBOLS);

EID: 51349108447     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IZS.2008.4497277     Document Type: Conference Paper

References (17)

1. A. Amraoui, A. Montanari. T. Richardson, and R. Urbanke. Finitelength scaling for iteratively decoded LDPC ensembles, submitted to IEEE Inform. Theory, 2004.
2. A. Amraoui, A. Montanari, and R. Urbanke, How to find good finitelength codes: from art towards science. European Transactions on Communications. 18(5):491-508. August 2007.
3. I. Andriyanova. Finite-length scaling for turbo-like ensembles over the BEC in preparation.
4. I. Andriyanova, J.P. Tillich. and J.C. Carlach. A new family of asymptotically good codes with high iterative decoding performances. In ICC'06. June 2006.
5. L. R. Bahl. J. Cocke, F. Jelinek, and J. Raviv, Optimal decoding of linear codes for minimazing symbol error rate. IEEE 'Trans. on Information Theory, 20:284-287, March 1974.
6. C. Berrou, A. Glavieux, and P. Thitimajshima. Near Shannon limit errorcorrecting coding and decoding. In ICC'93, pages 1064-1070. Genève. Switzerland. May 1993.
7. C. Di, D. Proietti. E. Telatar, and R. Urbanke. Finite-length analysis of low-density parity-check codes on the binary erasure channel. IEEE Trans. on Information Theory, 48(6): 1569-1579. June 2002.
8. D. Divsalar, H. Jin, and R. J. McEliece. Coding theorems for 'turbolike' codes. In Proc. 36th Allerton Conf. on Coomunication, Control, and Computing., pages 201-210. Allerton, Illinois, September 1998.
9. J. Ezri, A. Montanari, and R. Urbanke. A generalization of the finitelength scaling approach beyond the BEC In Proc. ISIT'2007, Nice. France, June 2007.
10. M. E. Fisher. In Critical Phenomena. 1971.
11. K. Fu and A. Anastasopoulos. Stopping set enumerator approximations for finite-length protograph LDPC codes. In Proc. ISIT'2007, Nice. France, June 2007.
12. H. Jin, A. Khandekar, and R. J. McEliece. Irregular repeat-accumulate codes. In Proc. 2nd International Symposium on Turbo Coding, pages 1-8, 2000.
13. S. Johnson. Finite-length repeat-accumulate codes in the binary erasure channel. In Proc. Asia-Pacific Conference on Communications, pages 217-221. Perth. Australia. 2005.
14. M. Luby. M. Mitzenmacher, A. Shokrollahi, and D. Spielman. Practical loss resilent codes. In Proceedings of the 30th annual ACM Symposium on Theory of Computing (STOC), pages 249-258, 1998.
15. O. Milenkovic. E. Soljanin, and P. Whiting. Asymptotic spectra of trapping sets in regular and irregular LDPC code ensembles. IEEE Trans. on Information Theory. 53(1):39-55. January 2007.
16. P. Oswald and A. Shokrollahi, Capacity-achieving sequences for the erasure channel. IEEE Trans. Inform. Theory, 48(12):3017-3028, 2002.
17. E. Rosnes and O. Ytrehus. Turbo decoding of the binary erasure channel: Finite-length analysis and turbo stopping sets, submitted to IEEE Inform. Theory, 2006.