Some convolutional codes whose free distances are maximal
Khaled Abdel-Ghaffar · IEEE Transactions on Information Theory · 1989
The free distance of a convolutional code of rate 1/n is bounded by n times the constant length of its encoder. Two classes of convolutional codes whose free distances meet this bound are studied. A technique of constructing convolutional codes that meet this bound for all sufficiently large n is given.>