Free Distance Bounds for Convolutional Codes

IEEE Transactions on Information Theory

Volumn 20, Issue 3, 1974, Pages 356-365

  Costello, Daniel J ^a  

^a ILLINOIS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC;

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

References (24)

1. D. J. Costello, “A construction technique for random-error-correcting convolutional codes,” IEEE Trans. Inform. Theory, vol. IT-15, pp. 631–636, Sept. 1969.
2. J. L. Massey and D. J. Costello, “Nonsystematic convolutional codes for sequential decoding in space applications,” IEEE Trans. Commun. Technol., vol. COM-19, pp. 806–813, Oct. 1971.
3. J. W. Layland and W. A. Lushbaugh, “A flexible high-speed sequential decoder for deep space channels,” IEEE Trans. Commun. Technol., vol. COM-19, pp. 813–820, Oct. 1971.
4. A. J. Viterbi, “Convolutional codes and their performance in communication systems,” IEEE Trans. Commun. Technol., vol. COM-19, pp. 751–772. Oct. 1971.
5. E. A. Bucher and J. A. Heller, “Error probability bounds for systematic convolutional codes,” IEEE Trans. Inform. Theory, vol. IT-16, pp. 219–224, Mar. 1970.
6. B. Neumann, “Distance properties of convolutional codes,” M.S. thesis, Dep. Elec. Eng., M.I.T., Cambridge, Mass., Aug. 1968.
7. J. A. Heller, “Short constraint length convolutional codes,” Jet Propulsion Lab., California Inst. Technol., Space Programs Summary 37–54, vol. 3, pp. 171–177, Oct./Nov. 1968.
8. F. P. Preparata, “An improved upper-bound to free distance for rate l/ N convolutional codes,” in Proc. UMR—Mervin J. Kelly Communications Conf., Rolla, Mo., Oct. 1970.
9. J. W. Layland and R. J. McEliece, “An upper bound on the free distance of a tree code,” Jet Propulsion Lab., California Inst. Technol., Space Programs Summary 37–62, vol. 3, pp. 63–64, Apr. 1970.
10. L. Bahl and F. Jelinek, “On the structure of rate 1/ N convolutional codes,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 192–196, Jan. 1972.
11. J. L. Massey and M. K. Sain, “Inverses of linear sequential circuits,” IEEE Trans. Comput., vol. C-17, pp. 330–337, Apr. 1968.
12. E. N. Gilbert, “A comparison of signalling alphabets,” Bell Syst. Tech. J., vol. 31, pp. 504–522, 1952.
13. J. L. Massey, Threshold Decoding. Cambridge, Mass.: M.I.T. Press, 1963.
14. E. K. Bower and S. J. Dwyer, III, “A strengthened asymptotic Gilbert bound for convolutional codes,” IEEE Trans. Inform. Theory, vol. IT-15, pp. 433–435, May 1969.
15. G. D. Forney, unpublished notes on convolutional codes.
16. E. R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968.
17. A. J. Viterbi, “Error bounds for convolutional codes and an asymptotically optimum decoding algorithm,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 260–269, Apr. 1967.
18. D. J. Costello, “Construction of convolutional codes for sequential decoding,” Univ. Notre Dame, Notre Dame, Ind., Tech. Rep. EE-692, Aug. 1969.
19. 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.
20. R. J. McEliece and H. C. Rumsey, “Capabilities of convolutional codes,” Jet Propulsion Lab., California Inst. Technol., Space Programs Summary 37–50, vol. 3, pp. 248–251, Apr. 1968.
21. 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.
22. J. P. Robinson, “Error propagation and definite decoding of convolutional codes,” IEEE Trans. Inform. Theory, vol. IT-14, pp. 121–128, Jan. 1968.
23. T. J. Wagner, “A Gilbert bound for periodic binary convolutional codes,” IEEE Trans. Inform. Theory, vol. IT-14, pp. 752–755, Sept. 1968.
24. D.J. Costello and T. N. Morrissey, “Strengthened lower bound on definite decoding minimum distance for periodic convolutional codes,” IEEE Trans. Inform. Theory, vol. IT-17, pp. 212–214, Mar. 1971.