On classes of convolutional codes that are not asymptotically catastrophic

IEEE Transactions on Information Theory

Volumn 46, Issue 2, 2000, Pages 663-669

  Hole, Kjell J ^a,b  

^a IEEE

^b UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

MATRIX ALGEBRA; POLES AND ZEROS;

CODE CONSTRUCTIONS;

CONVOLUTIONAL CODES;

EID: 0033879223     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.825838     Document Type: Article

References (20)

1. K. Abdel-Ghaffar, R. J. McEliece, and G. Solomon, "Some partial-unit-memory convolutional codes," Jet Propulsion Lab., Pasadena, CA, TDA Progress Rep. 42-107, Nov. 15, 1991.
2. J. Conan, "The weight spectra of some short low-rate convolutional codes," IEEE Trans. Commun., vol. COM-32, pp. 1050-1053, Sept. 1984.
3. G. D. Forney, Jr., "Structural analysis of convolutional codes via dual codes," IEEE Trans. Inform. Theory, vol. IT-19, pp. 512-518, July 1973.
4. F. Hemmati and D. J. Costello, Jr., "Asymptotically catastrophic convolutional codes," IEEE Trans. Inform. Theory, vol. IT-26, pp. 298-304, May 1980.
5. K. J. Hole, "A note on asymptotically catastrophic convolutional codes of rate (n-1)/n," IEEE Trans. Commun., vol. 45, pp. 1014-1016, Sept. 1997.
6. M. F. Hole and K. J. Hole, "Tight bounds on the minimum average weight per branch for rate (n-1)/n convolutional codes," IEEE Trans. Inform. Theory, vol. 43, pp. 1301-1305, July 1997.
7. K. J. Hole and Ø Ytrehus, "Cosets of convolutional codes with least possible maximun zero- and one-run lengths," IEEE Trans. Inform. Theory, vol. 44, pp. 423-131, Jan. 1998.
8. 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.
9. R. Johannesson and K. Zigangirov, "Distances and distance bounds for convolutional codes - An overview," in Topics in Coding Theory In Honor of L. H. Zetterberg, Lecture Notes in Control and Information Sciences no.128. New York: Springer-Verlag, 1989, pp. 109-136.
10. R. M. Karp, "A characterization of the minimum cycle mean in a digraph," Discr. Math., vol. 23, pp. 309-311, 1978.
11. G. S. Lauer, "Some optimal partial-unit-memory codes," IEEE Trans. Inform. Theory, vol. IT-25, pp. 240-243, Mar. 1979.
12. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
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. J. McEliece, "The algebraic theory of convolutional codes," in Handbood of Coding Theory, V. S. Pless and W. C. Huffman, Eds. Amsterdam, The Netherlands: North-Holland, 1998, ch. 12.
15. W. W. Peterson and E. J. Weldon, Jr., Error-Correcting Codes, 2nd ed. Cambridge, MA: MIT Press, 1972.
16. P. Piret, Convolutional Codes. Cambridge, MA: MIT Press, 1988.
17. J. Rosenthal and E. V. York, "A construction of binary BCH convolutional codes," in Proc. 1997 IEEE Int. Symp. Information Theory, Ulm, Germany, July 4, 1997, p. 291.
18. _, "BCH convolutional codes," IEEE Trans. Inform. Theory, to be published.
19. I. L. Traiger and A. Gill, "On an asymptotic optimization problem in finite, directed, weighted graphs," Inform. Contr., vol. 13, pp. 527-533, 1968.
20. Ø. Ytrehus, "A note on high rate binary convolutional codes," Dep. Informatics, Univ. Bergen, Bergen, Norway, Tech. Rep. 68, Aug. 11, 1992.