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 minimalpolynomial.
本文解决了整环上两条序列的最短线性递归问题，并给出了递归极小多项式的方法。
2
Finally, we present an efficient algorithm for computing the minimalpolynomial 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.