1. Ding C.S., Xiao G.Z., Shan W.J.: The Stability Theory of Stream Ciphers[M]. Lecture Notes in Computer Science, vol. 561, pp. 85–88. Springer, Berlin (1991).
2. Games R.A., Chan A.H.: A fast algorithm for determining the complexity of a binary sequence with period $$2^n$$ . IEEE Trans. Inf. Theory 29(1), 144–146 (1983).
3. Fu F., Niederreiter H., Su, M.: The characterization of $$2^n$$ -periodic binary sequences with fixed 1-error linear complexity. In: Gong G., Helleseth T., Song H.-Y., Yang K. (eds.) SETA 2006, Lecture Notes in Computer Science, vol. 4086, pp. 88–103. Springer, Berlin (2006).
4. Kavuluru R.: $$2^n$$ -periodic binary sequences with fixed 2-error or 3-error linear complexity. In: Golomb S., Parker M., Pott A., Winterhof A. (eds.) SETA 2008. Lecture Notes in Computer Science, vol. 5203, pp. 252–265. Springer, Berlin (2008).
5. Kavuluru R.: Characterization of $$2^n$$ -periodic binary sequences with fixed 2-error or 3-error linear complexity. Des. Codes Cryptogr. 53, 75–97 (2009).