Nanda Kambhatla
ACL 2004
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
Nanda Kambhatla
ACL 2004
Raymond Wu, Jie Lu
ITA Conference 2007
Alfonso P. Cardenas, Larry F. Bowman, et al.
ACM Annual Conference 1975
G. Ramalingam
Theoretical Computer Science