{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T19:06:52Z","timestamp":1754161612428,"version":"3.41.2"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Designs, Codes and Cryptography"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1023\/a:1024156525801","type":"journal-article","created":{"date-parts":[[2003,9,12]],"date-time":"2003-09-12T17:56:22Z","timestamp":1063389382000},"page":"149-164","source":"Crossref","is-referenced-by-count":24,"title":["On the Linear Complexity of the Sidelnikov-Lempel-Cohn-Eastman Sequences"],"prefix":"10.1007","volume":"29","author":[{"given":"Gohar M.","family":"Kyureghyan","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Pott","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5122122_CR1","volume-title":"Gauss and Jacobi sums","author":"B. C. Berndt","year":"1998","unstructured":"B. C. Berndt, R. J. Evans and K. S. Williams, Gauss and Jacobi sums, John Wiley & Sons Inc., New York (1998)."},{"key":"5122122_CR2","volume-title":"Design Theory","author":"T. Beth","year":"1999","unstructured":"T. Beth, D. Jungnickel and H. Lenz, Design Theory, 2nd ed., Cambridge University Press, Cambridge, Vol. 1 (1999).","edition":"2nd ed."},{"key":"5122122_CR3","volume-title":"Stream Ciphers and Number Theory","author":"T. W. Cusick","year":"1998","unstructured":"T. W. Cusick, C. Ding and A. Renvall, Stream Ciphers and Number Theory, North-Holland Publishing Co., Amsterdam (1998)."},{"key":"5122122_CR4","doi-asserted-by":"crossref","unstructured":"T. Helleseth and K. Yang, On binary sequences of period n = p\n\n                    m\n                   \u2212 1 with optimal autocorrelation, In (T. Helleseth, P. Kumar and K. Yang, eds.), Proceedings of SETA01, (2002) pp. 209\u2013217.","DOI":"10.1007\/978-1-4471-0673-9_15"},{"key":"5122122_CR5","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0166-218X(99)00085-2","volume":"95","author":"D. Jungnickel","year":"1999","unstructured":"D. Jungnickel and A. Pott, Perfect and almost perfect sequences, Discrete Applied Mathematics, Vol. 95 (1999) pp. 331\u2013359.","journal-title":"Discrete Applied Mathematics"},{"key":"5122122_CR6","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1109\/TIT.1977.1055672","volume":"23","author":"A. Lempel","year":"1977","unstructured":"A. Lempel, M. Cohn and W. L. Eastman, A class of balanced binary sequences with optimal autocorrelation properties, IEEE Transactions on Information Theory, Vol. 23 (1977) pp. 38\u201342.","journal-title":"IEEE Transactions on Information Theory"},{"key":"5122122_CR7","unstructured":"R. Lidl and H. Niederreiter, Finite Fields, Encyclopedia of Mathematics and Its Applications, 2nd ed., Cambridge University Press, Vol. 20 (1997)."},{"key":"5122122_CR8","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0094449","volume-title":"Finite Geometry and Character Theory","author":"A. Pott","year":"1995","unstructured":"A. Pott, Finite Geometry and Character Theory, Lecture Notes in Mathematics, Springer-Verlag, Berlin, Heidelberg, Vol. 1601 (1995)."},{"key":"5122122_CR9","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1090\/S0894-0347-99-00298-2","volume":"12","author":"B. Schmidt","year":"1999","unstructured":"B. Schmidt, Cyclotomic integers and finite geometry, J. Am. Math. Soc., Vol. 12 (1999) pp. 929\u2013952, to appear.","journal-title":"J. Am. Math. Soc."},{"key":"5122122_CR10","first-page":"16","volume":"5","author":"V. M. Sidel'nikov","year":"1969","unstructured":"V. M. Sidel'nikov, Some k-valued pseudo-random sequences and nearly equidistant codes, Problemy Pereda\u010dci Informacii, Vol. 5 (1969) pp. 16\u201322.","journal-title":"Problemy Pereda\u010dci Informacii"},{"key":"5122122_CR11","volume-title":"Cyclotomy and Difference Sets","author":"T. Storer","year":"1967","unstructured":"T. Storer, Cyclotomy and Difference Sets, Markham Publishing Co., Chicago, Ill. (1967)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1024156525801.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1024156525801\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1024156525801.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T03:50:10Z","timestamp":1753761010000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1024156525801"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":11,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["5122122"],"URL":"https:\/\/doi.org\/10.1023\/a:1024156525801","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}