节点文献

A formula on linear complexity of highest coordinate sequences from maximal periodic sequences over Galois rings

推荐 CAJ下载
PDF下载
不支持迅雷等下载工具，请取消加速工具后下载。

【Author】 HU Lei and SUN Nigang (State Key Laboratory of Information Security, Graduate School of Chinese Academy of Sciences, Beijing 100049, China)

【摘要】 <正>Using a polynomial expression of the highest coordinate map, we deduce an exact formula on the linear complexity of the highest coordinate sequence derived from a maximal periodic sequence over an arbitrary Galois ring of characteristic p2 , where p is a prime. This generalizes the known result of Udaya and Siddiqi for the case that the Galois ring is Z4.更多还原

【Abstract】 Using a polynomial expression of the highest coordinate map, we deduce an exact formula on the linear complexity of the highest coordinate sequence derived from a maximal periodic sequence over an arbitrary Galois ring of characteristic p2 , where p is a prime. This generalizes the known result of Udaya and Siddiqi for the case that the Galois ring is Z4.更多还原

【关键词】 Galois ring； highest coordinate sequence； linear complexity.；
【Key words】 Galois ring； highest coordinate sequence； linear complexity.；

【基金】 Supported by National Natural Science Foundation of China (Grant Nos. 60373041 and 90104034)

【文献出处】 Progress in Natural Science ,自然科学进展(英文版) , 编辑部邮箱 ,2006年09期

【分类号】O153.3
【被引频次】1
【下载频次】12

知网节下载

节点文献中：

本文链接的文献网络图示:

本文的引文网络

节点文献