1. [1] T. Cusick, C. Ding, and A. Renvall, Stream Ciphers and Number Theory, Elsevier, Amsterdam, 1998.
2. [2] C. Ding, G. Xiao, and W. Shan, The Stability Theory of Stream Ciphers, Springer, Heidelberg, 1991.
3. [3] T. Etzion, N. Kalouptsidis, N. Kolokotronis, K. Limniotis, and K.G. Paterson, “Properties of the error linear complexity spectrum,” IEEE Trans. Inf. Theory, vol.55, no.10, pp.4681-4686, Oct. 2009.
4. [4] F. Fu, H. Niederreiter, and M. Su, “The characterization of 2n-periodic binary sequences with fixed 1-error linear complexity,” in SETA 2006. LNCS, eds. G. Gong, T. Helleseth, and H. Song, vol.4086, pp.88-103, Springer, Heidelberg, 2006.
5. [5] R.A. Games and A.H. Chan, “A fast algorithm for determining the complexity of a pesudo-random sequence with period 2n,” IEEE Trans. Inf. Theory, vol.29, pp.144-146, 1983.