{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:47:28Z","timestamp":1725536848804},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642041587"},{"type":"electronic","value":"9783642041594"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04159-4_10","type":"book-chapter","created":{"date-parts":[[2009,8,22]],"date-time":"2009-08-22T05:19:34Z","timestamp":1250918374000},"page":"151-164","source":"Crossref","is-referenced-by-count":1,"title":["Counting Functions for the k-Error Linear Complexity of 2 n -Periodic Binary Sequences"],"prefix":"10.1007","author":[{"given":"Ramakanth","family":"Kavuluru","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Klapper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"10_CR1","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/s11767-006-0005-9","volume":"24","author":"Z. Fengxiang","year":"2007","unstructured":"Fengxiang, Z., Wenfeng, Q.: The 2-error linear complexity of 2\n                    n\n                  -periodic binary sequences with linear complexity 2\n                    n\n                  \u2009\u2212\u20091. Journal of Electronics (China)\u00a024(3), 390\u2013395 (2007)","journal-title":"Journal of Electronics (China)"},{"issue":"1","key":"10_CR2","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1109\/TIT.1983.1056619","volume":"29","author":"R.A. Games","year":"1983","unstructured":"Games, R.A., Chan, A.H.: A fast algorithm for determining the complexity of a pseudo-random sequence with period 2\n                    n\n                  . IEEE Trans. Inform. Theory\u00a029(1), 144\u2013146 (1983)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"10_CR3","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. Inform. Theory\u00a046(2), 694\u2013698 (2000)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"10_CR4","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                    n\n                  -periodic binary sequences. IEEE Trans. Inform. Theory\u00a051(3), 1151\u20131155 (2005)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"10_CR5","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10623-006-9029-2","volume":"42","author":"W. Meidl","year":"2007","unstructured":"Meidl, W., Venkateswarlu, A.: Remarks on the k-error linear complexity of p\n                  \n                    n\n                  -periodic sequences. Design, Codes and Cryptography\u00a042(2), 181\u2013193 (2007)","journal-title":"Design, Codes and Cryptography"},{"key":"10_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-82865-2","volume-title":"Analysis and Design of Stream Ciphers","author":"R.A. Rueppel","year":"1986","unstructured":"Rueppel, R.A.: Analysis and Design of Stream Ciphers. Springer, Heidelberg (1986)"},{"issue":"4","key":"10_CR7","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                    n\n                  . IEEE Trans. Inform. Theory\u00a039(4), 1398\u20131401 (1993)","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04159-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T13:43:51Z","timestamp":1552139031000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04159-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041587","9783642041594"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04159-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}