1) error location polynomial
错误位置多项式
1.
The decoding algorithm is the kernel technique of RS code, and the step-by-step algorithm doesn′t need to search the error location polynomial, so it saves the decoding time compared with the traditional ones.
其译码算法是实现RS码的核心,Step-by-step算法与传统的译码算法相比,不用计算错误位置多项式,可以大大地节省译码时间。
2.
The RS(204,188)encoding is obtained by using MATLAB software,which involves getting error location polynomial and the key equation,error location,error value,and finally the completion of error correction.
解码主要包括求伴随子、求错误位置多项式和关键等式、错误位置、错误值,最后完成纠错。
2) error locator polynomial
错误位置多项式
1.
In decoding of BCH or RS, Chien search or a lookup table are usually used for finding roots of an error locator polynomial σ(x) in the GF(2m).
对BCH码和RS码解码时,常用Chien搜索法或直接查表法求取GF(2m)上错误位置多项式σ(x)的根。
3) error polynomial
错误多项式
1.
Contrast to ordinary R\|S decoding algorithm,our algorithm operates criterion,it has character that it doesn t extract the root and value of error polynomial,and is adapt to be implemented by VLSI.
与常规Ｒ－Ｓ译码算法相比，该算法运算规范，具有不用求错误多项式的根和错误值、硬件开销小、吞吐率高等优点，适合超大规模集成电路的实现。
4) errata locator polynomial
勘误定位多项式
5) k-position error spectrum
k位置错误谱
1.
To understand more about the k-error linear complexity the k-position error spectrum which will describe the stability of sequences is analyzed.
但k错线性复杂度不能全面反映序列的稳定性,所以对k位置错误谱进行了研究,加深对k错线性复杂度的理解,更好得反映序列的稳定性。
6) loading-location misuse error
装入位置误用错误
补充资料：多项式乘多项式法则
Image:1173836820929048.jpg
多项式乘多项式法则
先用一个多项式的每一项乘以另一个多项式的每一项，再把所得的积相加。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。