This paper gives some properties of companion matrixofpolynomial over finite field with its application for evaluating period of linear shift register sequence and minimal length of cyclic code.
A polynomial algorithm about minimal marking of structural live Petri nets is presented, it is based on incidence matrix and the constructive of transitions sequence.
从网的关联矩阵以及所定义变迁发生序列的结构,求解结构活网的极小标识,得到了一个多项式时间算法。
3
Finally, we present an efficient algorithm for computing the minimalpolynomialof a polynomial matrix. It determines the coefficient polynomials term by term from lower to higher degree.