Finite-length repeat-accumulate codes on the binary erasure channel

2005 Asia-Pacific Conference on Communications

Volumn 2005, Issue , 2005, Pages 217-221

  Johnson, Sarah J ^a  

^a UNIVERSITY OF NEWCASTLE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINARY CODES; CODES (SYMBOLS); DECODING;

BINARY ERASURE CHANNEL; DECODING PERFORMANCE; DENSITY PARITY; FINITE LENGTH;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 33845308807     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/APCC.2005.1554051     Document Type: Conference Paper

References (4)

1. D. Divsalar, H. Jin, and R. J. McEliece, "Coding theorems for "turbolike" codes," in Proc. 36th Allerton Conf. on Communications, Control, and Computing, Allerton, Illinois, September 1998, pp. 201-210.
2. C. Di, D. Proietti, I. E. Telatar, T. J. Richardson, and R. L. Urbanke, "Finite-length analysis of low-density parity-check codes on the binary erasure channel," IEEE Trans. Inform. Theory, vol. 48, no. 6, pp. 1570-1579, June 2002.
3. A. Orlitsky, R. L. Urbanke, K. Viswanathan, and J. Zhang, "Stopping sets and the girth of Tanner graphs," in Proc. International Symposium on Information Theory (ISIT'2002), Lausanne, Switzerland, June 30-July 5 2002, p. 2.
4. T. J. Richardson and R. L. Urbanke, "Finite-length density evolution and the distribution of the number of iterations on the binary erasure channel," unpublished manuscript, available at 〈http://lthcwww.epfl. ch/papers/RiU02.ps〉.