minimal polynomial of matrix

基本解釋

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.
從網(wǎng)的關(guān)聯(lián)矩陣以及所定義變遷發(fā)生序列的結(jié)構(gòu)，求解結(jié)構(gòu)活網(wǎng)的極小標(biāo)識(shí)，得到了一個(gè)多項(xiàng)式時(shí)間算法。
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.
最后，我們給出了一種計(jì)算多項(xiàng)式矩陣最小多項(xiàng)式或特征多項(xiàng)式的有效算法，它從低次項(xiàng)到高次項(xiàng)逐項(xiàng)確定最小多項(xiàng)式的系數(shù)多項(xiàng)式。
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.
本文給出了有限域上多項(xiàng)式的友矩陣的某些性質(zhì)，及其在計(jì)算線性移位寄存器序列的周期和循環(huán)碼的最小長(zhǎng)度的應(yīng)用。