The distance properties of a class of rates

and

binary convolutional codes recently constructed by Paaske are reported. The data comprise the truncated input and output weight distributions of the codewords in the incorrect subset and the column distance function. which is strongly related to the computational effort of sequential decoding. The minimum asymptotic growth rate of the weights in the subset of unmerged codewords has been conjectured to be an important parameter; values of this parameter have also been included.