然后由债务信度网络构造了容量费用网络，利用最小费用循环流问题给出了该模型的一个多项式算法。
Then we construct a capacity cost network from the debt credit degree network. Finally, by applying minimum cost circulation flow problem, we give a polynomial algorithm for this model.
最后，在分块反对称反循环矩阵性质的基础上，给出了其特征值和特征多项式以及相似对角阵。
Finally, based on these characteristics, the eigenvalues and eigenvalues polynomials and its diagonal matrix were given.
给定一个循环码，求取它的覆盖多项式集合目前尚无系统的方法。
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.
以国际标准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.
本文给出了有限域上多项式的友矩阵的某些性质，及其在计算线性移位寄存器序列的周期和循环码的最小长度的应用。
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.
当有限域的特征不整除群的阶时，给出了直接写出相应的多项式环的本原幂等元的方法，从而可以直接写出所有的极小循环码。
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.
本文研究利用快速多项式变换(FPT)计算二维循环卷积的几种算法，改进了其中的一种算法，编制了相应的计算机程序。
In this paper, algorithms for computing 2-d circular convolution by using Fast Polynomial Transform (FPT) are reviewed and discussed, and then an improved algorithm is presented.
但是，该方法的关键是寻求循环码的一个覆盖多项式集合。
The key point of this method is to find a set of covering polynomials.
但是，该方法的关键是寻求循环码的一个覆盖多项式集合。
The key point of this method is to find a set of covering polynomials.
应用推荐