Decoding beyond the BCH bound using multiple sets of syndrome sequences (Corresp.)
Decoding beyond the BCH bound using multiple sets of syndrome sequences (Corresp.)
复制标题
使用多组校正子序列进行超出 BCH 范围的解码（Corresp.）
DOI：
10.1109/tit.1974.1055178
复制
发表时间：
1974
期刊：
影响因子：
--
通讯作者：
K. Tzeng
中科院分区：
文献类型：
--
作者：
C. Hartmann;K. Tzeng
许多循环码是由具有多个连续根的多项式生成的。因此，多于一组的校正子序列可用于解码。本文提出了一种基于Berlekamp迭代算法的译码方法，该方法利用多组伴随式序列对BCH界以外的循环码进行译码。
Many cyclic codes are generated by polynomials possessing more than one set of consecutive roots. Thus more than one set of syndrome sequences are available for decoding. In this correspondence, a decoding method based on Berlekamp's iterative algorithm is presented which makes use of the multiple sets of syndrome sequences for decoding such cyclic codes beyond the BCH bound.