$2^n$ -周期二元序列的4错线性复杂度分布
The 4-error linear complexity distribution for $2^n$-periodic binary sequences
摘要:
利用组合数学中的筛法,研究了基于Games-Chan算法的$2^n$ -周期二元序列的$k$ -错误线性复杂度分布。对于$k=4,5$,给出了线性复杂度小于$2^n$的$2^n$ -周期平衡二元序列的$k$ -错误线性复杂度的完全计数函数.作为结果的结果,$2^n$ -周期二元序列(具有线性复杂度$2^n$或小于$2^n$)的4-错误线性复杂度的完全计数函数是明显的。一般地,用类似的方法可以得到关于$2^n$ -周期二元序列的$k$ -错误线性复杂度的完全计数函数。
英文摘要:
By using the sieve method of combinatorics, we study $k$-error linear complexity distribution of $2^n$-periodic binary sequences based on Games-Chan algorithm. For $k=4,5$, the complete counting functions on the $k$-error linear complexity of $2^n$-periodic balanced binary sequences (with linear complexity less than $2^n$) are presented. As a consequence of the result, the complete counting functions on the 4-error linear complexity of $2^n$-periodic binary sequences (with linear complexity $2^n$ or less than $2^n$) are obvious. Generally, the complete counting functions on the $k$-error linear complexity of $2^n$-periodic binary sequences can be obtained with a similar approach.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。