科研之友
微信
新浪微博
Facebook
分享链接
摘要
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.
- 出版日期2012-1
