On the structure of rate 1/n convolutional codes.
It is shown what choice there is in assigning output digits to transitions of binary rate 1/n code trellis so that the latter will correspond to a convolutional code. A new upper bound on free distance of rate 1/n convolutional codes is also derived, and the results obtained are used to determine the length of the largest input sequence that can conceivably result in an output whose weight is equal to the free distance of a code of rate 1/2.
Bahl, L.↗