Skip to main content

On the covering radius of convolutional codes

  • Covering Codes
  • Conference paper
  • First Online:
Algebraic Coding (Algebraic Coding 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 781))

Included in the following conference series:

Abstract

We consider a problem of calculating covering capabilities for convolutional codes. An upper bound on covering radius for convolutional code is obtained by random coding arguments. The estimates on covering radius for some codes with small constraint length are presented.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.L. Graham, N.J. Sloane, “On the covering radius of codes,” IEEE Trans. Inform. Theory, vol. IT-31, pp. 385–401, 1985.

    Google Scholar 

  2. G.D. Forney, “Convolutional codes, II Maximum likelihood decoding,” Inform, and Control, vol. 25, pp. 222–266, 1974.

    Google Scholar 

  3. G.D. Cohen, “A nonconstructive upper bound on covering radius'” IEEE Trans. Inform. Theory, vol. IT-29, pp. 352–353, 1983.

    Google Scholar 

  4. A.R. Calderbank and P.C. Fishbum, A. Rabinovich, “Covering properties of convolutional codes and associated lattices”, submitted to IEEE Trans. Inform. Theory, May 1992.

    Google Scholar 

  5. J.K. Wolf, “Efficient maximum likelihood decoding of linear block codes using a trellis,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 76–80, 1978.

    Google Scholar 

  6. F.J. MakWilliams and N.J.A. Sloane, The theory of error-correcting codes. New York: North-Holland, 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

G. Cohen S. Litsyn A. Lobstein G. Zémor

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bocharova, I.E., Kudryashov, B.D. (1994). On the covering radius of convolutional codes. In: Cohen, G., Litsyn, S., Lobstein, A., Zémor, G. (eds) Algebraic Coding. Algebraic Coding 1993. Lecture Notes in Computer Science, vol 781. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57843-9_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-57843-9_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57843-7

  • Online ISBN: 978-3-540-48357-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics