【摘要】：定義周期為2n的線性復(fù)雜度和k錯線性復(fù)雜度均高的二元序列為優(yōu)秀序列,設(shè)計了遺傳算法來生成2n周期優(yōu)秀二元序列.對周期為8、16、32,k值為N/4的情況,匹配各種參數(shù)搜索優(yōu)秀序列,用Lauder-Paterson算法對得到的結(jié)果序列的線性復(fù)雜度譜進行了分析,以說明它們確實是優(yōu)秀序列.由實驗結(jié)果推測周期N為2n的二元優(yōu)秀序列當k取N/4、N/8時的k錯線性復(fù)雜度滿足規(guī)律LCk(S)≤N-2k+1(對周期為64、128、256的序列也進行了實驗驗證),并且優(yōu)秀序列在所有同周期的二元序列中所占的比例為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