{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:00:01Z","timestamp":1772283601852,"version":"3.50.1"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,3,10]],"date-time":"2013-03-10T00:00:00Z","timestamp":1362873600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s10623-013-9805-8","type":"journal-article","created":{"date-parts":[[2013,3,9]],"date-time":"2013-03-09T03:07:25Z","timestamp":1362798445000},"page":"55-75","source":"Crossref","is-referenced-by-count":9,"title":["The $$k$$ -error linear complexity distribution for $$2^n$$ -periodic binary sequences"],"prefix":"10.1007","volume":"73","author":[{"given":"Jianqin","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wanquan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,3,10]]},"reference":[{"key":"9805_CR1","doi-asserted-by":"crossref","unstructured":"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\u201388. Springer, Berlin (1991).","DOI":"10.1007\/3-540-54973-0"},{"key":"9805_CR2","unstructured":"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\u2013146 (1983)."},{"key":"9805_CR3","unstructured":"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\u2013103. Springer, Berlin (2006)."},{"key":"9805_CR4","unstructured":"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\u2013265. Springer, Berlin (2008)."},{"key":"9805_CR5","doi-asserted-by":"crossref","unstructured":"Kavuluru R.: Characterization of $$2^n$$ -periodic binary sequences with fixed 2-error or 3-error linear complexity. Des. Codes Cryptogr. 53, 75\u201397 (2009).","DOI":"10.1007\/s10623-009-9295-x"},{"key":"9805_CR6","unstructured":"Kurosawa K., Sato F., Sakata T., Kishimoto W.: A relationship between linear complexity and $$k$$ -error linear complexity. IEEE Trans. Inf. Theory 46(2), 694\u2013698 (2000)."},{"key":"9805_CR7","unstructured":"Meidl W.: On the stablity of $$2^{n}$$ -periodic binary sequences. IEEE Trans. Inf. Theory 51(3), 1151\u20131155 (2005)."},{"key":"9805_CR8","doi-asserted-by":"crossref","unstructured":"Rueppel, R.A.: Analysis and Design of Stream Ciphers (chap. 4). Springer, Berlin (1986).","DOI":"10.1007\/978-3-642-82865-2"},{"key":"9805_CR9","unstructured":"Stamp M., Martin C.F.: An algorithm for the $$k$$ -error linear complexity of binary sequences with period $$2^{n}$$ . IEEE Trans. Inf. Theory 39, 1398\u20131401 (1993)."},{"key":"9805_CR10","doi-asserted-by":"crossref","unstructured":"Zhou J.Q.: A counterexample concerning the 3-error linear complexity of $$2^n$$ -periodic binary sequences. Des. Codes Cryptogr. 64(3), 285\u2013286 (2012).","DOI":"10.1007\/s10623-011-9576-z"},{"key":"9805_CR11","doi-asserted-by":"crossref","unstructured":"Zhu F.X., Qi W.F.: The 2-error linear complexity of $$2^n$$ -periodic binary sequences with linear complexity $$2^n$$ -1. J. Electron. (China) 24(3), 390\u2013395 (2007).","DOI":"10.1007\/s11767-006-0005-9"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-013-9805-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-013-9805-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-013-9805-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:58:35Z","timestamp":1559231915000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-013-9805-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,10]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["9805"],"URL":"https:\/\/doi.org\/10.1007\/s10623-013-9805-8","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,10]]}}}