Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering
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
Sai Zeng, Angran Xiao, et al.
CAD Computer Aided Design
Conference paper
Performance test case generation for microprocessors
Pradip Bose
VTS 1998
Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science