Conference paper
Optimization algorithms for energy-efficient data centers
Hendrik F. Hamann
InterPACK 2013
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
Hendrik F. Hamann
InterPACK 2013
Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007
Rolf Clauberg
IBM J. Res. Dev
G. Ramalingam
Theoretical Computer Science