Enumeration of convolutional codes and minimal encoders
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.