Rajiv Ramaswami, Kumar N. Sivarajan
IEEE/ACM Transactions on Networking
Paper
Some Convolutional Codes Whose Free Distances are Maximal
Abstract
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
Related
David S. Kung
DAC 1998
Frank R. Libsch, S.C. Lien
IBM J. Res. Dev
J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998