Non-binary low rate convolutional codes with almost optimum weight spectrum

  • Sergei I. Kovalev
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 573)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    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.Google Scholar
  2. [2]
    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.Google Scholar
  3. [3]
    K.A.S. Abdel-Ghaffar “Some convolutional codes whose free distances are maximal,” IEEE Trans. Inform. Theory, vol. IT-35, pp. 188–191, 1989.CrossRefGoogle Scholar
  4. [4]
    A. J. Viterbi, J. K. Omura “Principles of digital communications and coding,” McGraw-Hill N.Y., 1979.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Sergei I. Kovalev
    • 1
  1. 1.Leningrad Aircraft Equipment InstituteLeningradUSSR

Personalised recommendations