科研之友
微信
新浪微博
Facebook
分享链接
摘要
In this paper, we obtain an upper bound on the order of a blockwise-burst [11] that can be detected by a row-cyclic array code [10] and obtain the fraction of blockwise-bursts of order exceeding the upper bound that go undetected. We also give a decoding algorithm for the correction of blockwise-bursts in row-cyclic array codes.
- 出版日期2014-7
