{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,18]],"date-time":"2024-07-18T07:15:46Z","timestamp":1721286946144},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[2008,3,6]],"date-time":"2008-03-06T00:00:00Z","timestamp":1204761600000},"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":[[2008,12]]},"DOI":"10.1007\/s10623-008-9178-6","type":"journal-article","created":{"date-parts":[[2008,3,5]],"date-time":"2008-03-05T14:51:46Z","timestamp":1204728706000},"page":"251-264","source":"Crossref","is-referenced-by-count":3,"title":["Composition of recursions and nonlinear complexity of periodic binary sequences"],"prefix":"10.1007","volume":"49","author":[{"given":"George","family":"Petrides","sequence":"first","affiliation":[]},{"given":"Johannes","family":"Mykkeltveit","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,3,6]]},"reference":[{"key":"9178_CR1","unstructured":"Berlekamp E.R.: Algebraic Coding Theory. McGraw-Hill Book Company (1968)."},{"key":"9178_CR2","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1023\/A:1008295603824","volume":"10","author":"D. Erdmann","year":"1997","unstructured":"Erdmann D., Murphy S. (1997). An approximate distribution for the maximum order complexity. Des. Codes Cryptogr. 10, 325\u2013339","journal-title":"Des. Codes Cryptogr."},{"key":"9178_CR3","unstructured":"Jansen C.J.A.: Investigations on nonlinear streamcipher systems: construction and evaluation methods, Ph.D. thesis, Technical University of Delft (1989)."},{"key":"9178_CR4","doi-asserted-by":"crossref","unstructured":"Kasselman P.R.: A statistical test for stream ciphers based on the maximum order complexity. In: Proceedings of the 1998 South African Symposium on Communications and Signal Processing, pp. 213\u2013218 (1998).","DOI":"10.1109\/COMSIG.1998.736951"},{"key":"9178_CR5","doi-asserted-by":"crossref","unstructured":"Limniotis K., Kolokotronis N., Kalouptsidis N.: Nonlinear complexity of binary sequences and connections with Lempel-Ziv compression. In: Proceedings of SETA\u201906 International Conference on Sequences and their Applications, Lecture Notes in Computer Science, vol. 4086, pp. 168\u2013179. Springer-Verlag (2006).","DOI":"10.1007\/11863854_14"},{"key":"9178_CR6","doi-asserted-by":"crossref","unstructured":"O\u2019Connor L., Snider T.: Suffix trees and string complexity. In: Advances in Cryptology\u2014EURO- CRYPT \u201992, Lecture Notes in Computer Science, vol. 658, pp. 138\u2013153. Springer (1993).","DOI":"10.1007\/3-540-47555-9_12"},{"key":"9178_CR7","doi-asserted-by":"crossref","unstructured":"Petrides G., Mykkeltveit J.: On the classification of periodic binary sequences into nonlinear complexity classes. In: Proceedings of SETA\u201906 International Conference on Sequences and their Applications, Lecture Notes in Computer Science, vol. 4086, pp. 209\u2013222. Springer-Verlag (2006).","DOI":"10.1007\/11863854_18"},{"issue":"9","key":"9178_CR8","doi-asserted-by":"crossref","first-page":"4257","DOI":"10.1109\/TIT.2006.880054","volume":"52","author":"P. Rizomiliotis","year":"2006","unstructured":"Rizomiliotis P. (2006). Constructing periodic binary sequences with maximum nonlinear Span. IEEE Trans. Inform. Theory 52(9): 4257\u20134261","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"9178_CR9","doi-asserted-by":"crossref","first-page":"1555","DOI":"10.1109\/TIT.2005.844090","volume":"51","author":"P. Rizomiliotis","year":"2005","unstructured":"Rizomiliotis P., Kalouptsidis N. (2005). Results on the nonlinear span of binary sequences. IEEE Trans. Inform. Theory 51(4): 1555\u20131563","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-008-9178-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-008-9178-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-008-9178-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:50:09Z","timestamp":1559231409000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-008-9178-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3,6]]},"references-count":9,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["9178"],"URL":"https:\/\/doi.org\/10.1007\/s10623-008-9178-6","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,3,6]]}}}