Ohad Shamir, Sivan Sabato, 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
Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science
Thomas R. Puzak, A. Hartstein, et al.
CF 2007
John M. Boyer, Charles F. Wiecha
DocEng 2009
Victor Valls, Panagiotis Promponas, et al.
IEEE Communications Magazine