Enumeration of convolutional codes and minimal encoders

  • Conor P. O'Donoghue
  • Cyril J. Burkley
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1355)


A full analysis of equivalent encoders is presented which is subsequently used to enumerate the minimal encoders generating a convolutional code. We extend the known results on rate 1/n minimal encoders to the rate k/n case and derive enumerators for minimal encoders, canonical systematic encoders and Convolutional codes. Numerical results show that the majority of codes have minimal encoders whose overall constraint length is more of less evenly distributed among the k rows and these codes are more likely to have good distance properties.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    G.D. Forney, Jr., “Convolutional codes I: Algebraic structure,” IEEE Trans. Inform. Theory, vol. IT-16, pp. 720–738, Nov. 1970. Correction in IEEE Trans. Inform. Theory, vol. IT-17, No. 3, p. 360, May 1971.CrossRefGoogle Scholar
  2. [2]
    W.J. Rosenberg, Structural Properties of Convolutional Codes, Ph.D. dissertation, University of California, Los Angeles, 1971.Google Scholar
  3. [3]
    G.D. Forney, Jr., Unpublished material.Google Scholar
  4. [4]
    T.J. Shusta, “Enumeration of minimal convolutional encoders,” IEEE Trans. Inform. Theory, vol. IT-23, No. 1, pp. 127–132, Jan. 1977.CrossRefGoogle Scholar
  5. [5]
    E. Paaske, “Short binary convolutional codes with maximal free distance for rates 2/3 and 3/4,” IEEE Trans. Inform. Theory, vol. IT-20, No. 5, pp. 683–9, Sept. 1974.CrossRefGoogle Scholar
  6. [6]
    D.G. Daut, J.W. Modestino and L.D. Wismer, “New short constraint length convolutional code constructions for selected rational rates,” IEEE Trans. Inform. Theory, vol. IT-28, No. 5, pp.794–800, Sept. 1982.CrossRefGoogle Scholar
  7. [7]
    M. Cedervall and R. Johannesson, “A fast algorithm for computing distance spectrum of convolutional codes,” IEEE Trans. Inform. Theory, vol. IT-35, No. 6, pp. 1146–1159, Nov. 1989.CrossRefGoogle Scholar
  8. [8]
    G. Seguin, “A random coding bound for fixed convolutional codes of rate 1/n,” IEEE Trans. Inform. Theory, vol. IT-40, No. 4, pp. 1668–1670, Sept. 1994.CrossRefMathSciNetGoogle Scholar
  9. [9]
    G.D. Forney, Jr., “Minimal bases of rational vector spaces, with applications to multivariable linear systems,” SIAM J. Control, vol. 13, pp.493–520, May 1975.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Conor P. O'Donoghue
    • 1
  • Cyril J. Burkley
    • 1
  1. 1.Dept. of Electronic EngineeringUniversity of LimerickLimerickIreland

Personalised recommendations