Charles H. Bennett, Aram W. Harrow, et al.
IEEE Trans. Inf. Theory
Paper
An efficient algorithm for searching optimal shortened cyclic single-burst-correcting codes
Abstract
An efficient algorithm searching for the best (shortened) cyclic burst-correcting codes is presented. The efficiency of the algorithm stems from the fact that no repeated syndromes are computed. It is shown how to achieve this goal by using Gray codes. © 2006 IEEE.
Related
Conference paper
Optimization algorithms for energy-efficient data centers
Hendrik F. Hamann
InterPACK 2013
Conference paper
Some experimental results on placement techniques
Maurice Hanan, Peter K. Wolff, et al.
DAC 1976
Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science