LINEAR COMPLEXITY AND THE MINIMAL POLYNOMIAL OF LINEAR RECURRING SEQUENCES OVER Z/(m)  

作　　者：戴宗铎 黄民强 

机构地区：[1]Graduate School,USTC,Academia Sinica,Beijing 100039,China [2]Institute of Systems Science,Academia Sinica,Beijing 100080,China

出　　处：《Systems Science and Mathematical Sciences》1991年第1期51-54,共4页

摘　　要：In this note we discuss the annihilating properties of sequences over Z/(m).Byconsidering the linear complexity and the annihilator structure,we derive the uniqueness conditionfor the minimal polynomial,and some related results of decimation sequences.In this note we discuss the annihilating properties of sequences over Z/(m).Byconsidering the linear complexity and the annihilator structure,we derive the uniqueness conditionfor the minimal polynomial,and some related results of decimation sequences.

关 键 词：Linear complexity OVER Z/(m) UNIQUENESS of MINIMAL polynomial 

分 类 号：N94[自然科学总论—系统科学]