Product accumulate codes: Properties and performance

Proceedings - 2001 IEEE Information Theory Workshop, ITW 2001

Volumn , Issue , 2001, Pages 21-23

  Narayanan, Krishna R ^a   Li, J ^a   Georghiades, Costas N ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY;

ACCUMULATE CODES; BLOCK LENGTHS; DECODING COMPLEXITY; OUTER PRODUCT; SHANNON LIMIT;

CODES (SYMBOLS);

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

References (6)

1. D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices", IEEE Trans. Info. Theory, vol. 45, Mar., 1999
2. J. Li, K. R. Narayanan and C. N. Georghiades, "Product accumulate codes: a class of capacity-approaching, low-complexity codes", submitted to IEEE Tran. Info Theory, May 2001
3. S. Benedetto D. Divsalar, G. Montorsi and F. Pollara, "Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding", IEEE Trans. Info. Theory, vol. 44, No. 3, May, 1998
4. D. Divsalar. H. Jin and R. J. McEliece, "Coding theorems for 'turbo-like' codes," Proc. 1998 Allerton Conf. Commun. and Control, pp. 201-210, Sept. 1998.
5. D. Divsalar, "A simple tight bound on error probability of block codes with application to turbo codes," TMO Progress Report, 42-139, Nov. 1999.
6. T. J. 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.