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

有限域上几类割圆序列的线性复杂度
引用本文:吴晨煌,陈智雄.有限域上几类割圆序列的线性复杂度[J].莆田学院学报,2009,16(2).
作者姓名:吴晨煌  陈智雄
作者单位:莆田学院数学与应用数学系,福建,莆田,351100
基金项目:福建省自然科学基金,福建省教育厅基金 
摘    要:给出了利用特征为p的扩张域Fq的割圆类构造的几类q-周期伪随机序列的线性复杂度和k-错线性复杂度的下界。该结果将补充Meidl和Winterhof提出的关于割圆生成器的线性复杂度的相关结果,同时推广了Aly、Meidl和Winterhof关于Fp上的p-周期割圆序列的线性复杂度及k-错线性复杂度等相关结论。

关 键 词:割圆生成器  线性复杂度  k-错线性复杂度  离散对数  有限域

On the Linear Complexity of Some Cyclotomic Sequences over Finite Fields
WU Chen-huang,CHEN Zhi-xiong.On the Linear Complexity of Some Cyclotomic Sequences over Finite Fields[J].journal of putian university,2009,16(2).
Authors:WU Chen-huang  CHEN Zhi-xiong
Institution:Mathematics & Applied Mathematics Department;Putian University;Putian Fujian 351100;China
Abstract:We present some lower bounds on the linear complexity and the k-error linear complexity over the field Fq of some q-periodic pseudorandom sequences defined in terms of cyclotomic classes of an extension field Fq of characteristic p.These results may partially complement results of Meidl and Winterhof on the linear complexity of corresponding cyclotomic generators and extend results of Aly,Meidl and Winterhof on the linear complexity and the k-error linear complexity of p-periodic cyclotomic sequences define...
Keywords:cyclotomic generator  linear complexity  k-error linear complexity  discrete logarithm  finite field  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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