Paper
The Qx-coder
M.J. Slattery, Joan L. Mitchell
IBM J. Res. Dev
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
Reena Elangovan, Shubham Jain, et al.
ACM TODAES
Apostol Natsev, Alexander Haubold, et al.
MMSP 2007
Limin Hu
IEEE/ACM Transactions on Networking