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.
Preview
Unable to display preview. Download preview PDF.
References
R.L. Graham, N.J. Sloane, “On the covering radius of codes,” IEEE Trans. Inform. Theory, vol. IT-31, pp. 385–401, 1985.
G.D. Forney, “Convolutional codes, II Maximum likelihood decoding,” Inform, and Control, vol. 25, pp. 222–266, 1974.
G.D. Cohen, “A nonconstructive upper bound on covering radius'” IEEE Trans. Inform. Theory, vol. IT-29, pp. 352–353, 1983.
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.
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.
F.J. MakWilliams and N.J.A. Sloane, The theory of error-correcting codes. New York: North-Holland, 1977.
Author information
Authors and Affiliations
Editor information
Rights 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