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
David A. Selby
IBM J. Res. Dev
Arun Viswanathan, Nancy Feldman, et al.
IEEE Communications Magazine
Reena Elangovan, Shubham Jain, et al.
ACM TODAES