摘要
研究了有限域Fq上qmpn-周期序列的k-错线性复杂度,给出了使其k-错线性复杂度严格小于其线性复杂度的最小k值的上下界,其中p为奇素数,q为模p2的原根,n为正整数,m为非负整数。
This paper examines the k-error linear complexity of q^mp^n-periodic sequences over Fq.It provides the bounds on the minimal k for which the k-error linear complexity is strictly less than the linear complexity,where p is an odd prime number,q is a primitive root modulo p^2,n0 and m≥0.
出处
《信息工程大学学报》
2011年第1期1-6,共6页
Journal of Information Engineering University
基金
国家自然科学基金资助项目(60833008)