摘要
k-错复杂度是指改变序列一个周期段中k个或少于k个符号后所得序列的最小线性复杂度。该文讨论了周期为2~pq(q为奇素数,2是模q^2的本原根)的二元序列线性复杂度与k的关系,这里k是满足LC_k(S^N)<LC(S^N)的最小值。文章的结果表明k与线性复杂度LC(S^N)的重量有关。
The κ-crror complexity of a periodic sequence of period N is denned as the smallest linear complexity that can be obtained by changing κ or fewer bits of the sequence per period. This correspondence shows the relationship between the linear complexity and the minimum value k for which the κ-error complexity is strictly less than the linear complexity, where period N equals to 2pq, q is an odd prime and 2 is a primitive root of mod q2.
出处
《电子与信息学报》
EI
CSCD
北大核心
2002年第12期1821-1824,共4页
Journal of Electronics & Information Technology
基金
国家自然科学基金(60073051)
973资助项目(G1999035804)
