{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,22]],"date-time":"2025-07-22T10:44:28Z","timestamp":1753181068130,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T00:00:00Z","timestamp":1573689600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T00:00:00Z","timestamp":1573689600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"crossref","award":["ZR2017MA001"],"award-info":[{"award-number":["ZR2017MA001"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No.61902429"],"award-info":[{"award-number":["No.61902429"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s12095-019-00411-4","type":"journal-article","created":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T05:29:06Z","timestamp":1573709346000},"page":"675-683","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude"],"prefix":"10.1007","volume":"12","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":"Zhixiong","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lianhai","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,14]]},"reference":[{"key":"411_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, 2934\u20132943 (2001)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"411_CR2","doi-asserted-by":"publisher","first-page":"2606","DOI":"10.1109\/18.796414","volume":"45","author":"C Ding","year":"1999","unstructured":"Ding, C., Helleseth, T., Lam, K. Y.: Several classes of sequences with three-level autocorrelation. IEEE Trans. Inform. Theory 45, 2606\u20132612 (1999)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"411_CR3","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 Crypt. 86, 2441\u20132450 (2018)","journal-title":"Des. Codes Crypt."},{"key":"411_CR4","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, 400\u2013411 (1995)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"411_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 \u201ca new method to compute the 2-adic complexity of binary sequences\u201d. IEEE Trans. Inform. Theory 60, 5803\u20135804 (2014)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"411_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."},{"key":"411_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, 7597\u20137604 (2011)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"411_CR8","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 Crypt. 86, 1329\u20131338 (2018)","journal-title":"Des. Codes Crypt."},{"key":"411_CR9","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, 467\u2013477 (2018)","journal-title":"Cryptogr. Commun."},{"key":"411_CR10","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, 6398\u20136405 (2010)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"411_CR11","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, 1278\u20131286 (2010)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"411_CR12","doi-asserted-by":"publisher","first-page":"6388","DOI":"10.1109\/TIT.2010.2079550","volume":"56","author":"Q Wang","year":"2010","unstructured":"Wang, Q., Du, X.: The linear complexity of binary sequences with optimal autocorrelation. IEEE Trans. Inform. Theory 56, 6388\u20136397 (2010)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"411_CR13","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, 2399\u20132406 (2014)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"411_CR14","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 and Their Applications 33, 14\u201328 (2015)","journal-title":"Finite Fields and Their Applications"},{"key":"411_CR15","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. Inform. Sci. 287, 26\u201331 (2014)","journal-title":"Inform. Sci."},{"key":"411_CR16","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. arXiv:1904.13012"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-019-00411-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-019-00411-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-019-00411-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,13]],"date-time":"2020-11-13T00:45:45Z","timestamp":1605228345000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-019-00411-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,14]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["411"],"URL":"https:\/\/doi.org\/10.1007\/s12095-019-00411-4","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2019,11,14]]},"assertion":[{"value":"21 March 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 November 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}