{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T12:45:27Z","timestamp":1744893927276},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,2,1]],"date-time":"2006-02-01T00:00:00Z","timestamp":1138752000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des Codes Crypt"],"published-print":{"date-parts":[[2006,2]]},"DOI":"10.1007\/s10623-005-6340-2","type":"journal-article","created":{"date-parts":[[2006,1,13]],"date-time":"2006-01-13T11:08:56Z","timestamp":1137150536000},"page":"159-178","source":"Crossref","is-referenced-by-count":19,"title":["Some Notes on the Linear Complexity of Sidel\u2019nikov-Lempel-Cohn-Eastman Sequences"],"prefix":"10.1007","volume":"38","author":[{"given":"Wilfried","family":"Meidl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arne","family":"Winterhof","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6340_CR1","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1006\/jnth.1999.2382","volume":"77","author":"N. Anuradha","year":"1999","journal-title":"J. Number Th"},{"key":"6340_CR2","volume-title":"Gauss and Jacobi sums, Canadian Mathematical Society Series of Monographs and Advanced Texts","author":"B.C. Berndt","year":"1998"},{"key":"6340_CR3","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1006\/jcta.1996.0088","volume":"76","author":"S.R. Blackburn","year":"1996","journal-title":"J. Combin. Theory Ser. A."},{"key":"6340_CR4","volume-title":"Stream Ciphers and Number Theory","author":"T.W. Cusick","year":"1998"},{"key":"6340_CR5","doi-asserted-by":"crossref","first-page":"391","DOI":"10.2307\/2371217","volume":"57","author":"L.E. Dickson","year":"1935","journal-title":"Amer. J. Math"},{"key":"6340_CR6","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1006\/ffta.1997.0181","volume":"3","author":"C. Ding","year":"1998","journal-title":"Finite Fields and Applications"},{"key":"6340_CR7","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0020-0190(98)00025-8","volume":"66","author":"C. Ding","year":"1998","journal-title":"Inform. Process. Lett."},{"key":"6340_CR8","doi-asserted-by":"crossref","first-page":"1276","DOI":"10.1109\/18.669398","volume":"44","author":"C. Ding","year":"1998","journal-title":"Trans. Inf. Th"},{"key":"6340_CR9","unstructured":"Eun Y.-C., Song H.-Y. (2004). One-error linear complexity over Fp of SLCE sequences, in: Proc. (Extended Abstracts) Intern. Conf. on Sequences and their Applications, Seoul (2004) pp.39\u201343."},{"key":"6340_CR10","unstructured":"M. Garaev, F. Luca, I. E. Shparlinski and A. Winterhof, On the linear complexity over ${\\mathbb F}_{p}$ of Sidelnikov sequences, Preprint (2004)."},{"key":"6340_CR11","unstructured":"Granville A. (1997). Arithmetic properties of binomial coefficients I Binomial coefficients modulo prime powers. Burnaby BC. (ed.), Organic mathematics 1995 CMS Conf. Proc. 20, Amer. Math. Soc. Providence, RI, (1997) pp. 253\u2013276."},{"key":"6340_CR12","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1515\/crll.1936.175.50","volume":"175","author":"H. Hasse","year":"1936","journal-title":"J. Reine. Angew. Math."},{"key":"6340_CR13","doi-asserted-by":"crossref","first-page":"1548","DOI":"10.1109\/TIT.2003.811924","volume":"49","author":"T. Helleseth","year":"2003","journal-title":"IEEE Trans. Inform. Theory"},{"key":"6340_CR14","doi-asserted-by":"crossref","first-page":"2468","DOI":"10.1109\/TIT.2004.834854","volume":"50","author":"T. Helleseth","year":"2004","journal-title":"IEEE Trans Inform Theory."},{"key":"6340_CR15","doi-asserted-by":"crossref","unstructured":"T. Helleseth and K. Yang, On binary sequences with period n=pm\u22121 with optimal autocorrelation, In (T. Helleseth, P. Kumar, and K. Yang, (eds.), Proceedings of SETA 01 (2002) pp. 209\u2013217.","DOI":"10.1007\/978-1-4471-0673-9_15"},{"key":"6340_CR16","volume-title":"Finite Fields","author":"D. Jungnickel","year":"1993"},{"key":"6340_CR17","doi-asserted-by":"crossref","unstructured":"Kyureghyan GM., Pott A. (2003). On the linear complexity of the Sidelnikov-Lempel-Cohn-Eastman sequences, Designs, Codes, and Cryptography Vol. 29 (2003) pp. 149\u2013164.","DOI":"10.1023\/A:1024156525801"},{"key":"6340_CR18","doi-asserted-by":"crossref","first-page":"103","DOI":"10.2140\/pjm.1955.5.103","volume":"5","author":"E. Lehmer","year":"1955","journal-title":"Pacific. J. Math."},{"key":"6340_CR19","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1109\/TIT.1977.1055672","volume":"23","author":"A. Lempel","year":"1977","journal-title":"IEEE. Trans. Inform. Th."},{"key":"6340_CR20","volume-title":"Finite Fields","author":"R. Lidl","year":"1983"},{"key":"6340_CR21","first-page":"122","volume":"6","author":"M.E. Lucas","year":"1878","journal-title":"Bull. Soc. Math. France."},{"key":"6340_CR22","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1049\/el:20000427","volume":"36","author":"H.D. L\u00fcke","year":"2000","journal-title":"Electronic Letters"},{"key":"6340_CR23","doi-asserted-by":"crossref","first-page":"2807","DOI":"10.1109\/18.959261","volume":"47","author":"W. Meidl","year":"2001","journal-title":"IEEE. Trans. Inform. Th."},{"key":"6340_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-540-24633-6_1","volume":"2948","author":"W. Meidl","year":"2004","journal-title":"Lecture Notes Comp. Sci."},{"key":"6340_CR25","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1002\/cpa.3160390713","volume":"39","author":"M.O. Rabin","year":"1986","journal-title":"Comm. Pure Appl. Math."},{"key":"6340_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-82865-2","volume-title":"Analysis and Design of Stream Ciphers","author":"R.A. Rueppel","year":"1986"},{"key":"6340_CR27","volume-title":"Cryptographic Applications of Analytic Number Theory. Complexity Lower Bounds and Pseudorandomness. Progress in Computer Science and Applied Logic. 22.","author":"I. Shparlinski","year":"2003"},{"key":"6340_CR28","doi-asserted-by":"crossref","unstructured":"I. Shparlinski, A. Winterhof, On the linear complexity of bounded integer sequences over different moduli, Preprint (2004).","DOI":"10.1016\/j.ipl.2005.08.004"},{"key":"6340_CR29","unstructured":"V. M. Sidel\u2019nikov, Some k-valued pseudo-random sequences and nearly equidistant codes. Problems of Information Transmission Vol. 5 (1969) pp. 12\u201316; translated from Problemy Pereda\u010di Informacii Vol.5 (1969) pp. 16\u201322 (Russian)."},{"key":"6340_CR30","volume-title":"Cyclotomy and Difference Sets","author":"T. Storer","year":"1967"},{"key":"6340_CR31","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/978-3-0348-7865-4_25","volume-title":"Coding Cryptography and Combinatorics","author":"A. Winterhof","year":"2004"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-005-6340-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-005-6340-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-005-6340-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,6]],"date-time":"2023-05-06T05:20:10Z","timestamp":1683350410000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-005-6340-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,2]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,2]]}},"alternative-id":["6340"],"URL":"https:\/\/doi.org\/10.1007\/s10623-005-6340-2","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,2]]}}}