Thomas R. Puzak, A. Hartstein, et al.
CF 2007
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
Hans Becker, Frank Schmidt, et al.
Photomask and Next-Generation Lithography Mask Technology 2004
Rolf Clauberg
IBM J. Res. Dev
Chidanand Apté, Fred Damerau, et al.
ACM Transactions on Information Systems (TOIS)