2~n周期优秀二元序列生成及其特性分析
发布时间：2019-03-02 20:00
【摘要】：定义周期为2n的线性复杂度和k错线性复杂度均高的二元序列为优秀序列,设计了遗传算法来生成2n周期优秀二元序列.对周期为8、16、32,k值为N/4的情况,匹配各种参数搜索优秀序列,用Lauder-Paterson算法对得到的结果序列的线性复杂度谱进行了分析,以说明它们确实是优秀序列.由实验结果推测周期N为2n的二元优秀序列当k取N/4、N/8时的k错线性复杂度满足规律LCk(S)≤N-2k+1(对周期为64、128、256的序列也进行了实验验证),并且优秀序列在所有同周期的二元序列中所占的比例为1/4.
[Abstract]:The binary sequence with high linear complexity of 2n and high linear complexity of k-error is defined as excellent sequence. A genetic algorithm is designed to generate 2n-periodic excellent binary sequence. When the period is 8, 16, 32, k is N, 4, matching all kinds of parameters to search the excellent sequence, the linear complexity spectrum of the obtained result sequence is analyzed by Lauder-Paterson algorithm to show that they are really excellent sequences. It is inferred from the experimental results that the k-error linear complexity of the binary excellent sequence with period N = 2n satisfies the law LCk (S) 鈮，
本文编号：2433415
[Abstract]:The binary sequence with high linear complexity of 2n and high linear complexity of k-error is defined as excellent sequence. A genetic algorithm is designed to generate 2n-periodic excellent binary sequence. When the period is 8, 16, 32, k is N, 4, matching all kinds of parameters to search the excellent sequence, the linear complexity spectrum of the obtained result sequence is analyzed by Lauder-Paterson algorithm to show that they are really excellent sequences. It is inferred from the experimental results that the k-error linear complexity of the binary excellent sequence with period N = 2n satisfies the law LCk (S) 鈮，
本文编号：2433415
本文链接：https://www.wllwen.com/kejilunwen/wltx/2433415.html
