arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0712.1775cs.ITmath.IT
收藏

关于厄米特码的错误位置和错误值的计算

On Computation of Error Locations and Values in Hermitian Codes

Rachit Agarwal

摘要:

我们得到了一种技术,以减少与厄米特码的解码相关的计算复杂性。特别是,我们提出了一种方法来计算错误的位置和值,使用一个单变量的错误定位器和一个单变量的错误评估多项式。为了实现这一点,我们介绍了厄米特码的半擦除解码的概念,并证明厄米特码的解码总是可以使用半擦除解码。主要结果是:* 搜索错误位置需要在$q^2$点上评估单变量错误定位器多项式,如在Chien搜索Reed-Solomon码中那样。* Forney的Reed-Solomon码误差值计算公式可以直接应用于Hermitian码的误差值计算。这种方法是从这样一种想法发展而来的,即传输修改后的信息形式可能比传输信息本身更有效。

英文摘要:

We obtain a technique to reduce the computational complexity associated with decoding of Hermitian codes. In particular, we propose a method to compute the error locations and values using an uni-variate error locator and an uni-variate error evaluator polynomial. To achieve this, we introduce the notion of Semi-Erasure Decoding of Hermitian codes and prove that decoding of Hermitian codes can always be performed using semi-erasure decoding. The central results are: * Searching for error locations require evaluating an univariate error locator polynomial over $q^2$ points as in Chien search for Reed-Solomon codes. * Forney's formula for error value computation in Reed-Solomon codes can directly be applied to compute the error values in Hermitian codes. The approach develops from the idea that transmitting a modified form of the information may be more efficient that the information itself.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑