{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:22:00Z","timestamp":1740122520294,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,1,21]],"date-time":"2021-01-21T00:00:00Z","timestamp":1611187200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,21]],"date-time":"2021-01-21T00:00:00Z","timestamp":1611187200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61902429"],"award-info":[{"award-number":["61902429"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s10623-020-00841-9","type":"journal-article","created":{"date-parts":[[2021,1,21]],"date-time":"2021-01-21T16:03:31Z","timestamp":1611245011000},"page":"695-707","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The 2-adic complexity of Yu-Gong sequences with interleaved structure and optimal autocorrelation magnitude"],"prefix":"10.1007","volume":"89","author":[{"given":"Yuhua","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tongjiang","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiuyan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,21]]},"reference":[{"issue":"7","key":"841_CR1","doi-asserted-by":"publisher","first-page":"2934","DOI":"10.1109\/18.959271","volume":"47","author":"KT Arasu","year":"2001","unstructured":"Arasu K.T., Ding C., Helleseth T., Kumar P.V., Martinsen H.M.: Almost difference sets and their sequences with optimal autocorrelation. IEEE Trans. Inform. Theory 47(7), 2934\u20132943 (2001).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"841_CR2","doi-asserted-by":"publisher","first-page":"2441","DOI":"10.1007\/s10623-018-0456-7","volume":"86","author":"C Fan","year":"2018","unstructured":"Fan C.: The linear complexity of a class of binary sequences with optimal autocorrelation. Des. Codes Cryptogr. 86, 2441\u20132450 (2018).","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"841_CR3","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1109\/18.370141","volume":"41","author":"G Gong","year":"1995","unstructured":"Gong G.: Theory and applications of $$q$$-ary interleaved sequences. IEEE Trans. Inform. Theory 41(2), 400\u2013411 (1995).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"8","key":"841_CR4","doi-asserted-by":"publisher","first-page":"5957","DOI":"10.1109\/TIT.2018.2811507","volume":"64","author":"R Hofer","year":"2018","unstructured":"Hofer R., Winterhof A.: On the 2-adic complexity of the two-prime generator. IEEE Trans. Inf. Theory 64(8), 5957\u20135960 (2018).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"841_CR5","doi-asserted-by":"publisher","first-page":"5803","DOI":"10.1109\/TIT.2014.2336843","volume":"60","author":"H Hu","year":"2014","unstructured":"Hu H.: Comments on \u201c a new method to compute the 2-adic complexity of binary sequences. IEEE Trans. Inform. Theory 60(9), 5803\u20135804 (2014).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"841_CR6","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s001459900024","volume":"10","author":"A Klapper","year":"1997","unstructured":"Klapper A., Goresky M.: Feedback shift registers, 2-adic span, and combiners with memory. J. Cryptol. 10, 111\u2013147 (1997).","journal-title":"J. Cryptol."},{"issue":"11","key":"841_CR7","doi-asserted-by":"publisher","first-page":"7597","DOI":"10.1109\/TIT.2011.2159575","volume":"57","author":"N Li","year":"2011","unstructured":"Li N., Tang X.: On the linear complexity of binary sequences of period $$4N$$ with optimal autocorrelation\/magnitude. IEEE Trans. Inform. Theory 57(11), 7597\u20137604 (2011).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"841_CR8","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1109\/7.192096","volume":"24","author":"HD L\u00fcke","year":"1988","unstructured":"L\u00fcke H.D.: Sequences and arrays with perfect periodic correlation. IEEE Trans. Aerosp. Electron. Syst. 24(3), 287\u2013294 (1988).","journal-title":"IEEE Trans. Aerosp. Electron. Syst."},{"key":"841_CR9","doi-asserted-by":"publisher","first-page":"1329","DOI":"10.1007\/s10623-017-0398-5","volume":"86","author":"W Su","year":"2018","unstructured":"Su W., Yang Y., Fan C.: New optimal binary sequences with period $$4p$$ via interleaving Ding-Helleseth-Lam sequences. Des. Codes Cryptogr. 86, 1329\u20131338 (2018).","journal-title":"Des. Codes Cryptogr."},{"issue":"4","key":"841_CR10","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/s12095-019-00411-4","volume":"12","author":"Y Sun","year":"2020","unstructured":"Sun Y., Wang Q., Yan T.: The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude. Cryptogr. Commun. 12(4), 675\u2013683 (2020).","journal-title":"Cryptogr. Commun."},{"issue":"3","key":"841_CR11","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s12095-017-0233-x","volume":"10","author":"Y Sun","year":"2018","unstructured":"Sun Y., Wang Q., Yan T.: The exact autocorrelation distribution and 2-adic complexity of a class of binary sequences with almost optimal autocorrelation. Cryptogr. Commun. 10(3), 467\u2013477 (2018).","journal-title":"Cryptogr. Commun."},{"issue":"12","key":"841_CR12","doi-asserted-by":"publisher","first-page":"6398","DOI":"10.1109\/TIT.2010.2081170","volume":"56","author":"X Tang","year":"2010","unstructured":"Tang X., Ding C.: New classes of balanced quaternary and almost balanced binary sequences with optimal autocorrelation value. IEEE Trans. Inform. Theory 56(12), 6398\u20136405 (2010).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"841_CR13","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.1109\/TIT.2009.2039159","volume":"56","author":"X Tang","year":"2010","unstructured":"Tang X., Gong G.: New constructions of binary sequences with optimal autocorrelation value\/magnitude. IEEE Trans. Inform. Theory 56(3), 1278\u20131286 (2010).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"841_CR14","doi-asserted-by":"publisher","first-page":"2399","DOI":"10.1109\/TIT.2014.2304451","volume":"60","author":"H Xiong","year":"2014","unstructured":"Xiong H., Qu L., Li C.: A new method to compute the 2-adic complexity of binary sequences. IEEE Trans. Inform. Theory 60(4), 2399\u20132406 (2014).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"841_CR15","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.ffa.2014.09.009","volume":"33","author":"H Xiong","year":"2015","unstructured":"Xiong H., Qu L., Li C.: 2-Adic complexity of binary sequences with interleaved structure. Finite Fields Their Appl. 33, 14\u201328 (2015).","journal-title":"Finite Fields Their Appl."},{"key":"841_CR16","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.ins.2014.07.026","volume":"287","author":"T Yan","year":"2014","unstructured":"Yan T., Chen Z., Li B.: A general construction of binary interleaved sequences of period $$4N$$ with optimal autocorrelation. Inf. Sci. 287, 26\u201331 (2014).","journal-title":"Inf. Sci."},{"key":"841_CR17","doi-asserted-by":"crossref","unstructured":"Yang, M., Zhang, L., Feng,K.: On the 2-adic complexity of a class of binary sequences of period $$4p$$ with optimal autocorrelation magnitude. IEEE International Symposium on Information Theory (2020).","DOI":"10.1109\/ISIT44484.2020.9174142"},{"issue":"10","key":"841_CR18","doi-asserted-by":"publisher","first-page":"4771","DOI":"10.1109\/TIT.2008.928999","volume":"54","author":"NY Yu","year":"2008","unstructured":"Yu N.Y., Gong G.: New binary sequences with optimal autocorrelation magnitude. IEEE Trans. Inform. Theory 54(10), 4771\u20134779 (2008).","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-020-00841-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-020-00841-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-020-00841-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,8]],"date-time":"2021-04-08T16:36:49Z","timestamp":1617899809000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-020-00841-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,21]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["841"],"URL":"https:\/\/doi.org\/10.1007\/s10623-020-00841-9","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2021,1,21]]},"assertion":[{"value":"23 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 December 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 December 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}