Abstract
We propose a construction of convolutional codes over the alphabet of size 2k with code rate of one bit per symbol and constraint length 3k, k =2,3,.... These codes have the least possible values of several first elements of the weight spectrum for large values of k.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. J. Viterbi, I. M. Jacobs, “Advances in coding and modulation for noncoherent channels affected by fading, partial band and multiple access interference,” Advances in communications systems, vol. 4, New York: Academic Press, pp. 279–308, 1975.
E. M. Gabidulin “Convolutional codes over large alphabets,” Proc. of the International Workshop on Algebraic and Combinatorial Coding Theory, Varna, Bulgaria, pp. 80–84, 1988.
K.A.S. Abdel-Ghaffar “Some convolutional codes whose free distances are maximal,” IEEE Trans. Inform. Theory, vol. IT-35, pp. 188–191, 1989.
A. J. Viterbi, J. K. Omura “Principles of digital communications and coding,” McGraw-Hill N.Y., 1979.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kovalev, S.I. (1992). Non-binary low rate convolutional codes with almost optimum weight spectrum. In: Cohen, G., Lobstein, A., Zémor, G., Litsyn, S. (eds) Algebraic Coding. Algebraic Coding 1991. Lecture Notes in Computer Science, vol 573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0034344
Download citation
DOI: https://doi.org/10.1007/BFb0034344
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55130-0
Online ISBN: 978-3-540-46739-7
eBook Packages: Springer Book Archive