Kaoutar El Maghraoui, Gokul Kandiraju, et al.
WOSP/SIPEW 2010
The free distance of a convolutional code of rate 1/n is bounded by n times the constraint 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 also given. © 1989 IEEE
Kaoutar El Maghraoui, Gokul Kandiraju, et al.
WOSP/SIPEW 2010
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
David A. Selby
IBM J. Res. Dev
Frank R. Libsch, S.C. Lien
IBM J. Res. Dev