On the covering radius of convolutional codes

  • Irina. E. Bocharova
  • Boris. D. Kudryashov
Covering Codes
Part of the Lecture Notes in Computer Science book series (LNCS, volume 781)


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.


Generate Matrix Linear Code Block Code Convolutional Code Covering Radius 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [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. [2]
    G.D. Forney, “Convolutional codes, II Maximum likelihood decoding,” Inform, and Control, vol. 25, pp. 222–266, 1974.Google Scholar
  3. [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. [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. [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. [5]
    F.J. MakWilliams and N.J.A. Sloane, The theory of error-correcting codes. New York: North-Holland, 1977.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Irina. E. Bocharova
    • 1
  • Boris. D. Kudryashov
    • 1
  1. 1.St.-Petersburg Academy of Airspace InstrumentationSt.-PetersburgRussia

Personalised recommendations