科研之友
微信
新浪微博
Facebook
分享链接
摘要
We propose a decoding algorithm for the (u vertical bar u + v)-construction that decodes up to half of the minimum distance of the linear code. We extend this algorithm for a class of matrix-product codes in two different ways. In some cases, one can decode beyond the error-correction capability of the code.
- 出版日期2013-6
