首页 | 本学科首页   官方微博 | 高级检索  
     检索      

LINEAR COMPLEXITY AND THE MINIMAL POLYNOMIAL OF LINEAR RECURRING SEQUENCES OVER Z/(m)
作者姓名:戴宗铎  黄民强
作者单位:Graduate School USTC,Academia Sinica,Beijing 100039,China,Institute of Systems Science,Academia Sinica,Beijing 100080,China
摘    要: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 AND THE MINIMAL POLYNOMIAL OF LINEAR RECURRING SEQUENCES OVER Z/(m)
Dai Zongduo.LINEAR COMPLEXITY AND THE MINIMAL POLYNOMIAL OF LINEAR RECURRING SEQUENCES OVER Z/(m)[J].Journal of Systems Science and Complexity,1991(1).
Authors:Dai Zongduo
Abstract:In this note we discuss the annihilating properties of sequences over Z/(m).By considering the linear complexity and the annihilator structure,we derive the uniqueness condition for the minimal polynomial,and some related results of decimation sequences.
Keywords:Linear complexity over Z/(m)  uniqueness of minimal polynomial
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号