{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T05:37:48Z","timestamp":1736573868882,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540445234"},{"type":"electronic","value":"9783540445241"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11863854_6","type":"book-chapter","created":{"date-parts":[[2006,9,19]],"date-time":"2006-09-19T08:27:22Z","timestamp":1158654442000},"page":"61-73","source":"Crossref","is-referenced-by-count":2,"title":["Linear Complexity over F p of Ternary Sidel\u2019nikov Sequences"],"prefix":"10.1007","author":[{"given":"Young-Sik","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jung-Soo","family":"Chung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jong-Seon","family":"No","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Habong","family":"Chung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","volume-title":"Algebraic Coding Theory","author":"E.R. Berlekamp","year":"1987","unstructured":"Berlekamp, E.R.: Algebraic Coding Theory. Aegean Park Press, Laguna Hills (1987)"},{"key":"6_CR2","first-page":"550","volume":"63","author":"R.E. Blahut","year":"1979","unstructured":"Blahut, R.E.: Transform techniques for error control codes. IBM J. Res. Devel.\u00a063, 550\u2013560 (1979)","journal-title":"IBM J. Res. Devel."},{"issue":"6","key":"6_CR3","doi-asserted-by":"publisher","first-page":"1548","DOI":"10.1109\/TIT.2003.811924","volume":"49","author":"T. Helleseth","year":"2003","unstructured":"Helleseth, T., Kim, S.-H., No, J.-S.: Linear complexity over F p and trace representation of Lempel-Cohn-Eastman sequences. IEEE Trans. Inf. Theory\u00a049(6), 1548\u20131552 (2003)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"6_CR4","doi-asserted-by":"publisher","first-page":"2468","DOI":"10.1109\/TIT.2004.834854","volume":"50","author":"T. Helleseth","year":"2004","unstructured":"Helleseth, T., Maas, M., Mathiassen, J.E., Segers, T.: Linear complexity over F p of Sidel\u2019nikov sequences. IEEE Trans. Inf. Theory\u00a050(10), 2468\u20132472 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Helleseth, T., Yang, K.: On binary sequences of period n\u2009=\u2009p m \u2009\u2212\u20091 with optimal autocorrelation. In: Proc. SETA 2001, pp. 29\u201330 (2001)","DOI":"10.1007\/978-1-4471-0673-9_15"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Kim, Y.-S., Chung, J.-S., No, J.-S., Chung, H.: On the linear complexity over F p of M-ary Sidel\u2019nikov sequences. In: Proc. IEEE ISIT 2005, pp. 2007\u20132011 (2005)","DOI":"10.1109\/ISIT.2005.1523697"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1023\/A:1024156525801","volume":"29","author":"G.M. Kyureghyan","year":"2003","unstructured":"Kyureghyan, G.M., Pott, A.: On the linear complexity of the Sidelnikov-Lempel-Cohn-Eastman sequences. Des., Codes and Cryptogr.\u00a029, 149\u2013164 (2003)","journal-title":"Des., Codes and Cryptogr."},{"issue":"1","key":"6_CR8","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1109\/TIT.1977.1055672","volume":"IT-23","author":"A. Lempel","year":"1977","unstructured":"Lempel, A., Cohn, M., Eastman, W.L.: A class of balanced binary sequences with optimal autocorrelation properties. IEEE Trans. Inf. Theory\u00a0IT-23(1), 38\u201342 (1977)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"6_CR9","first-page":"12","volume":"5","author":"V.M. Sidel\u2019nikov","year":"1969","unstructured":"Sidel\u2019nikov, V.M.: Some k-valued pseudo-random sequences and nearly equidistant codes. Probl. Inf. Transm.\u00a05(1), 12\u201316 (1969)","journal-title":"Probl. Inf. Transm."}],"container-title":["Lecture Notes in Computer Science","Sequences and Their Applications \u2013 SETA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11863854_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T22:27:14Z","timestamp":1736548034000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11863854_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540445234","9783540445241"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11863854_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}