On the k-error Sequences of 2n-Periodic Binary Sequences

[1] Ding C S.[J].Xiao G Z, and Shan W J. The Stability Theory of Stream Ciphers[M]. Berlin: Springer-Verlag.1991,Chapter 5. [2] Stamp M and Martin C F. An algorithm for the k-error linear complexity of binary sequences with period 2n[J].IEEE Trans. on information Theory.1993, 39(4):1398-1401 [3] Kurosawa K, Sato F, and Imamura T. A relationship between linear complexity and k-error linear complexity[J].IEEE Trans. on Iinformation Theory.2000, 46(2):694-698 [4] Meidl W. On the stablity of 2n-periodic binary sequences[J].IEEE Trans. on Information Theory.2005, 51(3):1151-1155 [5] Rueppel R A. Analysis and Design of Stream Ciphers[M]. Berlin: Springer-Verlag.[J]..1986,:- [6] Fu Fangwei.[J].Niederreiter Harald, and Su Ming. The characterization of 2n-periodic binary sequences with fixed 1-error linear complexity[C]. Sequences and Their Applictions. Beijing.2006,:- [7] Games R A and Chan A H. A fast algorithm for determining the complexity of a pseudo random sequence with period 2n[J].IEEE Trans. on Information Theory.1983, 29(1):144-146 [8] Zhu Fengxiang and Qi Wengfeng. The 2-error linear complexity of 2n-periodic binary sequences with linear complexity 2n-1[J]. Journal of Electronics(China), 2007, 24(3): 390-395.