A Fast Algorithm for Computing Distance Spectrum of Convolutional Codes

IEEE Transactions on Information Theory

Volumn 35, Issue 6, 1989, Pages 1146-1159

  Cedervall, Mats ^a   Johannesson, Rolf ^a  

^a LUND UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY; PROBABILITY;

BIT ERROR PROBABILITY; CODE TREE; CONVOLUTIONAL CODES; DISTANCE SPECTRUM; FAST ALGORITHM; HAMMING DISTANCE;

CODES, SYMBOLIC;

EID: 0024766697     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.45271     Document Type: Article

References (25)

1. A. J. Viterbi, “Convolutional codes and their performance in communication systems,” IEEE Trans. Commun. Techno!., vol. COM-19. pp. 751-772. Oct. 1971.
2. J. L. Massey and D. J. Costello, Jr., “Nonsystematic convolutional codes for sequential decoding in space applications,” IEEE Trans. Commun. Technol., vol. COM-19, pp. 806-813, Oct. 1971.
3. R. Johannesson, “Robustly optimal rate one-half binary convolutional codes.” IEEE Trans. Inform. Theory, vol. IT-21. pp. 464-468, July 1975.
4. P. R. Chevillat and D. J. Costello, Jr., “Distance and computing in sequential decoding,” IEEE Trans. Commun., vol. COM-24, pp. 440-447. Apr. 1976.
5. G. D. Forney, Jr. “Use of a sequential decoder to analyze a convolutional code structure,” IEEE Trans. Inform. Theory, vol. IT-16. pp. 793-795, Nov. 1970.
6. J. P. Odcnwalder. “Optimal decoding of convolutional codes,” Ph.D. dissertation, Dep. Syst. Sci., Sch. Eng. Appl. Sci., Univ. of California, Los Angeles, 1970.
7. L. R. Bahl. C. D. Cullum, W. D. Frazer, and F. Jelinek, “An efficient algorithm for computing the free distance,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 437-439, Nov. 1972.
8. K. J. Larson, “Comments on ‘An efficient algorithm for computing free distance’ by Bahl et al.,” IEEE Trans. Inform. Theory, vol. IT-19. pp. 577-579, July, 1973.
9. D. Divsalar, “Performance of mismatched receivers on bandlimited channels,” Ph.D. dissertation, Dep. Syst. Sci., Sch. Eng. Appl. Sci., Univ. of California. Los Angeles, 1978.
10. M. Cedervall. “Contribution to the decoding and structure of convolutional codes.” Ph.D. dissertation, Dep. of Comput. Eng., Lund Univ. Lund. Sweden, 1983.
11. D. J. Costello, Jr., “A construction technique for random-error-correcting convolutional codes,” IEEE Trans. Inform. Theory, vol. IT-15. pp. 631-636. Sept. 1969.
12. J. L. Massey. “Error bounds for tree codes, trellis codes, and convolutional codes with encoding and decoding procedures,” in Coding and Complexity, CISM Courses and Lectures no. 216, G. Longo, Ed. Vienna, Austria: Springer-Verlag, 1975.
13. J. L. Massey and M. K. Sain, “Inverses of linear sequential circuits,” IEEE Trans. Comput., vol. C-17, pp. 330-337, Apr. 1968.
14. R. Johannesson and E. Paaske, “Further results on binary convolutional codes with an optimum distance profile,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 264-268, Mar. 1978.
15. J. Conan, “The weight spectra of some short low-rate convolutional codes,” IEEE Trans. Commun. vol. COM-32, pp. 1050-1053, Sept. 1984.
16. L. R. Bahl and F. Jelinek, “Rate 1/2 convolutional codes with complementary generators,” IEEE Trans. Inform. Theory, vol. IT-17, pp. 718-727, Nov. 1971.
17. A. J. Vinck, private communication, 1982.
18. H. J. Helgert, “Short constraint length rate 1/2 ‘quick-look’ codes,” IEEE Trans. Commun., vol. COM-23, pp. 768-773, July 1975.
19. H. J. Helgert “Correction to ‘Short constraint length rate 1/2 ‘quick-look’ codes’.” IEEE Trans. Commun., vol. COM-24, p. 286, Feb. 1976.
20. J. J. Bussgang. “Some properties of binary convolutional code generators,” IEEE Trans. Inform. Theory, vol. IT-11. pp. 90-100. Jan. 1965.
21. R. Johannesson. “Some long rate one-half binary convolutional codes with an optimum distance profile,” IEEE Trans. Inform. Theory, vol. IT-22, pp. 629-631, Sept. 1976.
22. J. L. Massey. private communication, 1974.
23. J. A. Heller, “Sequential decoding: Short constraint length convolutional codes.” Jet Propulsion Lab., California Inst. Technol., Pas-sadena. Space Program Summary 37-54, vol. 3, Dec. 1968. pp. 171-174.
24. J. Layland and R. McEliece, “An upper bound on the free distance of a tree code,” Jet Propulsion Lab., California Inst. Technol., Pasadena, Space Program Summary 37-62, vol. 3. Apr. 1970. pp. 63-64.
25. J. H. Griesmer, “A bound for error-correcting codes,” IBM J. Res. Develop., vol. 4. No. 5. 1960.