Israel Cidon, Leonidas Georgiadis, et al.
IEEE/ACM Transactions on Networking
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
Compression for data archiving and backup revisited
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
Yao Qi, Raja Das, et al.
ISSTA 2009
Conference paper
Social networks and discovery in the enterprise (SaND)
Inbal Ronen, Elad Shahar, et al.
SIGIR 2009