Certain Generalizations of Concatenated Codes — Exponential Error Bounds and Decoding Complexity

IEEE Transactions on Information Theory

Volumn 26, Issue 5, 1980, Pages 527-534

  Hirasawa, Shigeichi ^a   Kasahara, Masao ^b   Namekawa, Toshihiko ^b   Sugiyama, Yasuo ^a  

^a MITSUBISHI ELECTRIC CORPORATION   (Japan)

^b OSAKA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC;

EID: 0019055465     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1980.1056243     Document Type: Article

References (10)

1. G. D. Fomey, Jr., concatenated codes. Cambridge, MA: M.I.T., 1966
2. J. E. Savage, “The complexity of decoders—Part II: Computational work and decoding time,” IEEE Trans. Inform. Theory, vol. IT-17, pp. 77–85, Jan. 1971.
3. J. L. Ramsey, “Cascaded tree codes,” M.I.T. Res. Lab. of Electron., Cambridge, MA, Tech. Rep. 478, Sept. 1970.
4. G. D. Forney, Jr., “Convolutional codes II: Maximum-likelihood decoding,” Inform. Contr„ vol. 25, pp. 222–266, July 1974.
5. R. G. Gallager, Information Theory, and Reliable Communication. New York: Wiley, 1968.
6. E. A. Bucher and J. A. Heller, “Error probability bounds for systematic convolutional codes,” IEEE Trans. Inform. Theory, vol. IT-16, pp. 214–224, Mar. 1970.
7. D. V. Sarwate, “On the complexity of decoding Goppa codes,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 515–516, July 1977.
8. J. Justesen, “On the complexity of decoding Reed-Solomon codes,” IEEE Trans. Inform. Theory, vol. IT-22, pp. 237–238, Mar. 1976.
9. A. J. Viterbi, “Error bounds for the convolutional codes and an asymptotically optimum decoding algorithm,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 260–269, Apr. 1967.
10. J. E. Savage, “A note on the performance of the concatenated codes,” IEEE Trans. Inform. Theory, vol. IT-16, pp. 512–513, July 1970.