{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:00:08Z","timestamp":1772283608614,"version":"3.50.1"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319120867","type":"print"},{"value":"9783319120874","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12087-4_5","type":"book-chapter","created":{"date-parts":[[2014,10,24]],"date-time":"2014-10-24T19:32:54Z","timestamp":1414179174000},"page":"70-85","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Cube Theory and Stable $$k$$-Error Linear Complexity for Periodic Sequences"],"prefix":"10.1007","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"}]},{"given":"Guanglu","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,25]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","first-page":"85","volume-title":"The Stability Theory of Stream Ciphers","year":"1991","unstructured":"Ding, C., Xiao, G., Shan, W., et al. (eds.): The Stability Theory of Stream Ciphers. LNCS, vol. 561, pp. 85\u201388. Springer, Heidelberg (1991)"},{"issue":"10","key":"5_CR2","doi-asserted-by":"publisher","first-page":"4681","DOI":"10.1109\/TIT.2009.2027495","volume":"55","author":"T Etzion","year":"2009","unstructured":"Etzion, T., Kalouptsidis, N., Kolokotronis, N., Limniotis, K., Paterson, K.G.: Properties of the error linear complexity spectrum. IEEE Trans. Inf. Theory 55(10), 4681\u20134686 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"5_CR3","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1109\/TIT.1983.1056619","volume":"29","author":"RA Games","year":"1983","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)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/11863854_8","volume-title":"Sequences and Their Applications \u2013 SETA 2006","author":"F-W Fu","year":"2006","unstructured":"Fu, F.-W., 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. LNCS, vol. 4086, pp. 88\u2013103. Springer, Heidelberg (2006)"},{"issue":"5","key":"5_CR5","doi-asserted-by":"publisher","first-page":"940","DOI":"10.1360\/jos160940","volume":"16","author":"H Hu","year":"2005","unstructured":"Hu, H., Feng, D.: Periodic sequences with very large 1-error linear complexity over $$Fq$$. J. Softw. 16(5), 940\u2013945 (2005)","journal-title":"J. Softw."},{"issue":"2","key":"5_CR6","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1109\/18.825845","volume":"46","author":"K Kurosawa","year":"2000","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)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1023\/B:DESI.0000035466.28660.e9","volume":"33","author":"W Meidl","year":"2004","unstructured":"Meidl, W.: How many bits have to be changed to decrease the linear complexity? Des. Codes Cryptogr. 33, 109\u2013122 (2004)","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"5_CR8","doi-asserted-by":"publisher","first-page":"1151","DOI":"10.1109\/TIT.2004.842709","volume":"51","author":"W Meidl","year":"2005","unstructured":"Meidl, W.: On the stability of $$2^n$$-periodic binary sequences. IEEE Trans. Inf. Theory 51(3), 1151\u20131155 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1109\/TIT.2002.807308","volume":"49","author":"H Niederreiter","year":"2003","unstructured":"Niederreiter, H.: Periodic sequences with large $$k$$-error linear complexity. IEEE Trans. Inf. Theory 49, 501\u2013505 (2003)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"1398","DOI":"10.1109\/18.243455","volume":"39","author":"M Stamp","year":"1993","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)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"5_CR11","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s10623-010-9379-7","volume":"58","author":"JQ Zhou","year":"2011","unstructured":"Zhou, J.Q.: On the $$k$$-error linear complexity of sequences with period 2$$p^n$$ over GF(q). Des. Codes Cryptogr. 58(3), 279\u2013296 (2011)","journal-title":"Des. Codes Cryptogr."},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Zhou, J.Q., Liu, W.Q.: The $$k$$-error linear complexity distribution for $$2^n$$-periodic binary sequences. Des. Codes Cryptogr. (2013). http:\/\/link.springer.com\/article\/10.1007\/s10623-013-9805-8","DOI":"10.1007\/s10623-013-9805-8"},{"key":"5_CR13","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). http:\/\/www.springerlink.com\/content\/3200vt810p232769\/","DOI":"10.1007\/s11767-006-0005-9"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12087-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,14]],"date-time":"2023-02-14T23:35:30Z","timestamp":1676417730000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-12087-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319120867","9783319120874"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12087-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"25 October 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}