Hence an algorithm for the minimal polynomial of a block circulant matrix over the field is presented.
bner基，从而给出了求块循环矩阵的极小多项式的算法。
参考来源 - 多项式代数及其应用We show a fast algorithm for determining the linear complexity and the minimal polynomial of the sequence, which is better than B-M algorithm.
我们给出了此序列的极小多项式和线性复杂度的一个快速算法,优于B-M算法。
参考来源 - 确定周期序列线性复杂度的快速算法·2,447,543篇论文数据，部分数据来源于NoteExpress
以上来源于: WordNet
This paper presents a solution to the problem of the shortest linear recurrence of two sequences over an integral domain and describes the recurrence of the minimal polynomial.
本文解决了整环上两条序列的最短线性递归问题，并给出了递归极小多项式的方法。
Finally, we present an efficient algorithm for computing the minimal polynomial of a polynomial matrix. It determines the coefficient polynomials term by term from lower to higher degree.
最后，我们给出了一种计算多项式矩阵最小多项式或特征多项式的有效算法，它从低次项到高次项逐项确定最小多项式的系数多项式。
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.
本文给出了有限域上多项式的友矩阵的某些性质，及其在计算线性移位寄存器序列的周期和循环码的最小长度的应用。
应用推荐