[1] GAMES R A, CHAN A H. A fast algorithm for determining the linear complexity of a binary sequence with period 2n[J]. IEEE Transactions on Information Theory, 1983, 29(1): 144-146. [2] DING C S, XIAO G Z, SHANW J. The Stability Theory of Stream Ciphers[M]. Berlin: Springer-Verlag, 1991: Chapter 5. [3] STAMP M, MARTIN C F. An algorithm for the k-error linear complexity of binary sequences with period 2n[J]. IEEE Transactions on Information Theory, 1993, 39(4): 1398-1401. [4] KAIDA T, UEHARA S, IMAMURA K. An algorithm for the k-error linear complexity of sequences over GF(pm) with period pn, p a prime[J]. Information and Computation, 1999, 151(2): 134-147. [5] LAUDER A G B, PATERSON K G. Computing the error linear complexity spectrum of a binary sequence of period 2n[J]. IEEE Transactions on Information Theory, 2003, 49(1): 273-280. [6] KAIDA T.On the generalized Lauder-Paterson algorithm and profiles of the k-error linear complexity for exponent periodic sequences[C]// Sequences and Their Applications - SETA 2004. Heidelberg: Springer, 2005, LNCS 3486: 166-178. [7] KURSOSAWA K, SATO F,SAKATA T, et al. A relationship between linear complexity and k-error linear complexity[J]. IEEE Transactions on Information Theory, 2000, 46(2): 694-698. [8] 赵耀东, 戚文峰. 二元周期序列的k错误线性复杂度[J]. 电子学报, 2005, 33(1): 12-16. ZHAO Yaodong, QI Wenfeng. On the k-error linear complexity of binary period sequences[J]. Acta Electronica Sinica, 2005, 33(1): 12-16. [9] MEIDL W, NIEDERREITER H. On the expected value of the linear complexity and k-error linear complexity of periodic sequences[J]. IEEE Transactions on Information Theory, 2002, 48(11): 2817-2825. [10] MEIDL W, VENKATESWARLU A. Remarks on the k-error linear complexity of pn-periodic sequences[J]. Designs, Codes and Cryptography, 2007, 42(2): 181-193. [11] 朱凤翔, 戚文峰.Fp上pn-周期序列的1-错线性复杂度[J]. 电子与信息学报, 2007, 29(9): 2222-2225. ZHU Fengxiang, QI Wenfeng. 1-error linear complexity of pn-periodic sequences over Fp[J]. Journal of Electronics & Information Technology, 2007, 29(9): 2222-2225. [12] 李鹤龄, 戚文峰.Fp上pn-周期序列的k-错线性复杂度[J]. 通信学报, 2010, 31(6): 19-24. LI Heling, QI Wenfeng. k-error sequences of pn-periodic sequences over Fp[J]. Journal on Communications, 2010, 31(6): 19-24. [13] CHANG Z L, KE P H. On the error linear complexity spectrum of binary sequences with period of power of two[J]. Chinese Journal of Electronics, 2015, 24(2): 366-372. [14] TANG Miao. An algorithm for computing the error sequence of pn-periodic binary sequences[J]. Applicable Algebra in Engineering, Communication and Computing, 2014, 25(3): 197-212. [15] 唐淼, 开晓山. 三元3n周期序列的k错线性复杂度的性质[J]. 中国科学技术大学学报, 2015, 45(2): 107-111, 116. TANG Miao, KAI Xiaoshan. Some properties of the k-error linear complexity of ternary 3n-periodic sequences[J]. Journal of University of Science and Technology of China, 2015, 45(2): 107-111, 116. |