ALGEBRAIC DECODING BEYOND EBCH OF SOME BINARY CYCLIC CODES, WHEN E-GREATER-THAN-EBCH

被引：14

作者：

BOURS, P

JANSSEN, JCM

VANASPERDT, M

VANTILBORG, HCA

机构：

[1] Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1990年 / 36卷 / 01期

关键词：

D O I：

10.1109/18.50396

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

It is well known that many cyclic codes have a true-error-correcting capability e that is strictly greater than the error-correcting capability eBCH, that follows from the BCH bound. The well-known Berlekamp-Massey decoding algorithm decodes only up to eBCH errors. In [2] and [3] an algorithm is described that decodes in certain cases up to eRoos, a lower bound on e coming from the Roos bound. In [1] an algebraic decoding algorithm can be found for the binary Golay code. Here similar, but sometimes more complex, algebraic decoding algorithms, that decode up to e' errors, eBCH< e' ≤ e, are presented for a number of other binary cyclic codes. © 1990 IEEE

引用

页码：214 / 222

页数：9