Bounds on Distances and Error Exponents of Unit Memory Codes

IEEE Transactions on Information Theory

Volumn 29, Issue 5, 1983, Pages 637-649

  Thommesen, Christian ^a   Justesen, Jørn ^b  

^a AALBORG UNIVERSITY   (Denmark)

^b TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC;

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

References (15)

1. L. N. Lee, “Short unit-memory byte-oriented binary convolutional codes having maximal free distance,” IEEE Trans. Inform. Theory, vol. IT-22, pp. 349-352, May 1976.
2. G. D. Forney, Jr., “Convolutional codes II: Maximum-likelihood decoding,” Inform. Control, vol. 25, pp. 222-266, July 1974.
3. G. D. Forney, Jr., “Convolutional codes I: Algebraic structure,” IEEE Trans. Inform. Theory, vol. IT-16, pp. 720-738, Nov. 1970.
4. R. Johannesson and E. Paaske, “Further results on binary convolutional codes with optimal distance profile,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 264-268, Mar. 1978.
5. G. S. Lauer, “Some optimal partial-unit-memory codes,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 240-243, Mar. 1979.
6. G. K. Huth and C. L. Weber, “Minimum weight convolutional codewords of finite length,” IEEE Trans. Inform. Theory, vol. IT-22, pp. 243-246, Mar. 1976.
7. B. Masnick and J. K. Wolf, “On linear unequal error protection codes,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 600-607, Oct. 1967.
8. C. E. Shannon, “A mathematical theory of communication,” Bell Syst. Tech. J., vol. 27, pp. 379-423, July 1948.
9. M. J. Aaltonen, “An asymptotic Hamming bound on the feedback decoding minimum distance of linear tree codes,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 396-397, May 1977.
10. M. S. Pinsker, “Bounds of the probability and of the number of correctable errors for nonblock codes,” Problemy Peredach. Inform., vol. 3, no. 4, pp. 58-71, 1967.
11. J. L. Massey, “Some algebraic and distance properties of convolutional codes,” in Error Correcting Codes, H. B. Mann, Ed. New York: Wiley, 1968, pp. 89-109.
12. D. J. Costello, Jr., “Free distance bounds for convolutional codes,” IEEE Trans. Inform. Theory, vol. IT-20, pp. 356-365, May 1974.
13. F. Hemmati and D. J. Costello, Jr., “Asymptotically catastrophic convolutional codes,” IEEE Trans. Inform. Theory, vol. IT-26, pp. 298-304, May 1980.
14. A. J. Viterbi and J. K. Omura, Principles of Digital Communication and Coding. New York: McGraw-Hill, 1979.
15. A. J. Viterbi and J. P. Odenwalder, “Further results on optimal decoding of convolutional codes,” IEEE Trans. Inform. Theory, vol. IT-15, pp. 732-734, Nov. 1969.