Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science
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
Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007
Xiaozhu Kang, Hui Zhang, et al.
ICWS 2008
Alfonso P. Cardenas, Larry F. Bowman, et al.
ACM Annual Conference 1975