Beomseok Nam, Henrique Andrade, et al.
ACM/IEEE SC 2006
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.
Beomseok Nam, Henrique Andrade, et al.
ACM/IEEE SC 2006
M.J. Slattery, Joan L. Mitchell
IBM J. Res. Dev
Limin Hu
IEEE/ACM Transactions on Networking
Victor Valls, Panagiotis Promponas, et al.
IEEE Communications Magazine