{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T05:45:04Z","timestamp":1761975904500,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T00:00:00Z","timestamp":1623974400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T00:00:00Z","timestamp":1623974400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s12095-021-00503-0","type":"journal-article","created":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T05:02:46Z","timestamp":1623992566000},"page":"183-199","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["The symmetric 2-adic complexity of sequences with optimal autocorrelation magnitude and length 8q"],"prefix":"10.1007","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1368-3827","authenticated-orcid":false,"given":"Vladimir","family":"Edemskiy","sequence":"first","affiliation":[]},{"given":"Yuhua","family":"Sun","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,18]]},"reference":[{"issue":"7","key":"503_CR1","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.: Several classes of sequences with three-level autocorrelation. IEEE Trans. Inf. Theory 45(7), 2606\u20132612 (1999)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"503_CR2","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1109\/18.904555","volume":"47","author":"C Ding","year":"2001","unstructured":"Ding, C., Helleseth, T., Martinsen, H.: New families of binary sequences with optimal three-valued autocorrelation. IEEE Trans. Inf. Theory 47 (1), 428\u2013433 (2001)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"503_CR3","doi-asserted-by":"publisher","first-page":"012013","DOI":"10.1088\/1742-6596\/1352\/1\/012013","volume":"1352","author":"VA Edemskiy","year":"2019","unstructured":"Edemskiy, V.A., Minin, A.B.: Linear complexity of binary sequences with optimal autocorrelation magnitude of length. MMPAM\u20192019. IOP Conf. Series J. Phys. Conf. Series. 1352, 012013 (2019)","journal-title":"MMPAM\u20192019. IOP Conf. Series J. Phys. Conf. Series."},{"key":"503_CR4","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":"503_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 a new method to compute the 2-adic complexity of binary sequences. IEEE Trans. Inform. Theory 60, 5803\u20135804 (2014)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"503_CR6","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":"2","key":"503_CR7","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1109\/TIT.2007.913238","volume":"54","author":"H Hu","year":"2008","unstructured":"Hu, H., Feng, D.: On the 2-adic complexity and the k-error 2-adic complexity of periodic binary sequences. IEEE Trans. Inf. Theory 54(2), 874\u2013883 (2008)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"503_CR8","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/S0166-218X(99)00085-2","volume":"95","author":"D Jungnickel","year":"1999","unstructured":"Jungnickel, D., Pott, A.: Perfect and almost perfect sequences. Discret. Appl. Math. 95, 331\u2013359 (1999)","journal-title":"Discret. Appl. Math."},{"key":"503_CR9","doi-asserted-by":"crossref","unstructured":"Klapper, A., Goresky, M.: Cryptanalysis Based on 2-Adic Rational Approxiamtion. In: CRYPTO 1995, LNCS, 963, pp 262\u2013273 (1995)","DOI":"10.1007\/3-540-44750-4_21"},{"key":"503_CR10","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":"503_CR11","doi-asserted-by":"publisher","first-page":"1457","DOI":"10.1049\/el.2016.2476","volume":"52","author":"EI Krengel","year":"2016","unstructured":"Krengel, E.I., Ivanov, P.V.: Two costructions of binary sequences with optimal autocorrelationmagnitude. Electron. Lett. 52, 1457\u20131459 (2016)","journal-title":"Electron. Lett."},{"key":"503_CR12","first-page":"175","volume":"168","author":"PH Langevin","year":"1994","unstructured":"Langevin, P.H.: Some sequences with good autocorrelation properties. Finite Fields 168, 175\u2013185 (1994)","journal-title":"Finite Fields"},{"key":"503_CR13","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":"503_CR14","first-page":"255","volume":"89","author":"Y Sun","year":"2008","unstructured":"Sun, Y., Shen, H.: New binary sequences of length 4p with optimal autocorrelation magnitude. Ars Combinatoria 89, 255\u2013262 (2008)","journal-title":"Ars Combinatoria"},{"issue":"3","key":"503_CR15","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."},{"key":"503_CR16","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/s12095-019-00411-4","volume":"12","author":"Y Sun","year":"2020","unstructured":"Sun, Y., Yan, T., Chen, Z., Wang, L.: The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude. Cryptogr. Commun. 12, 675\u2013683 (2020)","journal-title":"Cryptogr. Commun."},{"key":"503_CR17","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. Designs Codes Cryptograp. 86, 1329\u20131338 (2018)","journal-title":"Designs Codes Cryptograp."},{"issue":"3","key":"503_CR18","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(3), 6398\u20136405 (2010)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"12","key":"503_CR19","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(12), 1278\u20131286 (2010)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"503_CR20","doi-asserted-by":"publisher","first-page":"1412","DOI":"10.1109\/18.144729","volume":"38","author":"J Wolfmann","year":"1992","unstructured":"Wolfmann, J.: Almost perfect autocorrelation sequences. IEEE Trans. Inf. Theory 38(4), 1412\u20131418 (1992)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"503_CR21","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1142\/S0129054116500350","volume":"27","author":"Z Xiao","year":"2016","unstructured":"Xiao, Z., Zeng, X., Sun, Z.: 2-Adic complexity of two classes of generalized cyclotomic binary sequences. Internationl. J. Foundat. Comput. Sci. 27 (7), 879\u2013893 (2016)","journal-title":"Internationl. J. Foundat. Comput. Sci."},{"key":"503_CR22","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":"503_CR23","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":"503_CR24","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. arXiv:1904.13012 (2019)","DOI":"10.1109\/ISIT44484.2020.9174142"},{"key":"503_CR25","unstructured":"Zhang, S., Yan, T.: Linear Complexity and Autocorrelation of two Classes of New Interleaved Sequences of Period 2N. arXiv:1801.08664 (2018)"},{"key":"503_CR26","doi-asserted-by":"publisher","unstructured":"Zhang, L., Zhang, J., Yang, M., Feng, K.: On the 2-Adic Complexity of the Ding-Helleseth-Martinsen Binary Sequences. In: IEEE Trans. Inform. Theory. https:\/\/doi.org\/10.1109\/TIT.2020.2964171 (2020)","DOI":"10.1109\/TIT.2020.2964171"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-021-00503-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-021-00503-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-021-00503-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,3]],"date-time":"2022-03-03T07:15:05Z","timestamp":1646291705000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-021-00503-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,18]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["503"],"URL":"https:\/\/doi.org\/10.1007\/s12095-021-00503-0","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2021,6,18]]},"assertion":[{"value":"30 November 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 June 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 June 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of Interests"}}]}}