Decoding of second order Reed-Muller codes with a large number of errors
Decoding of second order Reed-Muller codes with a large number of errors
复制标题
具有大量错误的二阶Reed-Muller码的译码
DOI：
10.1109/itw.2005.1531882
复制
发表时间：
2005
期刊：
影响因子：
--
通讯作者：
Bassem Sakkour
中科院分区：
文献类型：
--
作者：
Bassem Sakkour
在二元对称通道上考虑了二阶Reed-Muller代码。我们提出了V.M Sidel'nikov和A.S.的修改版本。 Pershakov算法，有问题的Peredachi Informatsii 1992，它具有n/sup 2/log（n）的复杂性。实验结果表明，算法将E超过N/2（1-e）纠正大多数重量模式，鉴于E超过N-1/3。这表现优于其他以RM代码而闻名的解码算法。已经评估了已知算法的解码性能，结果对应于这些算法的渐近性能。
Second order Reed-Muller codes are considered over a binary symmetric channel. We present a modified version of V.M Sidel'nikov and A.S. Pershakov algorithm, Problemy Peredachi Informatsii 1992, that has complexity of order n/sup 2/log(n). Experimental results show that the algorithm corrects most error patterns of weight up to n/2(1-e) given that e exceeds n-1/3. This outperforms other decoding algorithms known for RM codes. Decoding performance for known algorithms has been evaluated and the results correspond to asymptotic performance for these algorithms.