并针对该系统所用的RS（255，247）码推导出了一些基本公式，包括生成多项式，伴随式矩阵，关键方程等。
At the same time, some basic formulas of RS(255,247)code are also concluded, such as generated polynomial, syndromes matrix, key equation and so on.
文章给出了CRC码中所含1的个数与生成多项式的关系的一个性质。
A property about the relation between the number "1" in CRC code and polynomial generation were presents in this paper.
给定一个循环码，求取它的覆盖多项式集合目前尚无系统的方法。
For a cyclic code, it is difficult to find the set of it's covering polynomials. We have not had a systematic method to find it.
但是，该方法的关键是寻求循环码的一个覆盖多项式集合。
The key point of this method is to find a set of covering polynomials.
本文给出了有限域上多项式的友矩阵的某些性质，及其在计算线性移位寄存器序列的周期和循环码的最小长度的应用。
This paper gives some properties of companion matrix of polynomial over finite field with its application for evaluating period of linear shift register sequence and minimal length of cyclic code.
本文讨论了我国电力系统远动通信中的编码问题，分析了如何选择缩短BC H码最优生成多项式和最佳同步多项式问题。
This paper discusses telecontrol communication coding for power systems in China and analyzes how to select the optimum generating polynomial and synchronization polynomial for shortened BCH codes.
当有限域的特征不整除群的阶时，给出了直接写出相应的多项式环的本原幂等元的方法，从而可以直接写出所有的极小循环码。
In the case of(Char(F_q), |G|)=1, we provide a method that writing down directly all the primitive idempotents of related polynomial ring, and hence that of all the minimum cyclic codes.
BCH码、RS码的译码问题主要归结为一个所谓关键方程的解决，也即是错位多项式的求法。
Decoding codes such as BCH, RS codes consist essentially of solving the key equation, namely, finding error locator polynomial.
以国际标准CRC-CCITT循环冗余校验码为研究对象，利用近世代数多项式理论证明其奇偶校验性质、最小码距和纠正单比特错误能力。
The polarities check ability, minimum code distance and capacity of correct single bit error of CRC-CCITT are proved by using galois field polynomial theory.
先分析了RS码的编解码原理，通过MATLAB软件产生了域元素及生成多项式，还获取了RS(204,188)的编码。
Firstly, the paper analyzes the coding and encoding principle of rs code, gets Galois field and generating polynomial using the MATLAB software, obtains the rs (204188) encoding, too.
我们推广了多项式构造码的方法，并发现许多之前的构造可以看做我们的特例。
In this talk, we generalize the ideas of code constructions from previous papers. It turns out that the codes in the previous papers can be viewed as special cases of those.
我们推广了多项式构造码的方法，并发现许多之前的构造可以看做我们的特例。
In this talk, we generalize the ideas of code constructions from previous papers. It turns out that the codes in the previous papers can be viewed as special cases of those.
应用推荐