{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T05:48:19Z","timestamp":1761976099892,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2024,4,16]],"date-time":"2024-04-16T00:00:00Z","timestamp":1713225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,16]],"date-time":"2024-04-16T00:00:00Z","timestamp":1713225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["12061027"],"award-info":[{"award-number":["12061027"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the Innovation Group Project of the Natural Science Foundation of Hubei Province of China","award":["2023AFA021"],"award-info":[{"award-number":["2023AFA021"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s10623-024-01399-6","type":"journal-article","created":{"date-parts":[[2024,4,16]],"date-time":"2024-04-16T05:01:50Z","timestamp":1713243710000},"page":"2473-2489","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Symmetric 2-adic complexity of Tang\u2013Gong interleaved sequences from generalized GMW sequence pair"],"prefix":"10.1007","volume":"92","author":[{"given":"Bo","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kangkang","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangyong","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zibi","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,16]]},"reference":[{"issue":"24\u201325","key":"1399_CR1","doi-asserted-by":"publisher","first-page":"2316","DOI":"10.1016\/j.tcs.2009.02.021","volume":"410","author":"Y Cai","year":"2009","unstructured":"Cai Y., Ding C.: Binary sequences with optimal autocorrelation. Theor. Comput. Sci. 410(24\u201325), 2316\u20132322 (2009).","journal-title":"Theor. Comput. Sci."},{"issue":"11","key":"1399_CR2","doi-asserted-by":"publisher","first-page":"1566","DOI":"10.1587\/transfun.E102.A.1566","volume":"102","author":"X Du","year":"2019","unstructured":"Du X., Zhao L., Niu Z.: 2-Adic complexity of two classes of generalized cyclotomic binary sequences with order 4. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102(11), 1566\u20131570 (2019).","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"2","key":"1399_CR3","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s12095-021-00503-0","volume":"14","author":"V Edemskiy","year":"2022","unstructured":"Edemskiy V., Sun Y.: The symmetric 2-adic complexity of sequences with optimal autocorrelation magnitude and length $$8q$$. Cryptogr. Commun. 14(2), 183\u2013199 (2022).","journal-title":"Cryptogr. Commun."},{"key":"1399_CR4","doi-asserted-by":"crossref","unstructured":"Edemskiy V., Wu C.: Symmetric 2-adic complexity of Ding\u2013Helleseth generalized cyclotomic sequences of period $$pq$$. In: International Conference on Information Security and Cryptology, Guangzhou, China, pp. 318\u2013327 (2021).","DOI":"10.1007\/978-3-030-71852-7_21"},{"key":"1399_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546907","volume-title":"Signal Design with Good Correlation: For Wireless Communications, Cryptography and Radar Applications","author":"S Golomb","year":"2005","unstructured":"Golomb S., Gong G.: Signal Design with Good Correlation: For Wireless Communications, Cryptography and Radar Applications. Cambridge University Press (2005)."},{"issue":"2","key":"1399_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. Inf. Theory 41(2), 400\u2013411 (1995).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"1399_CR7","doi-asserted-by":"publisher","first-page":"2847","DOI":"10.1109\/TIT.2002.804044","volume":"48","author":"G Gong","year":"2002","unstructured":"Gong G.: New designs for signal sets with low cross correlation, balance property, and large linear span: $$GF(p)$$ case. IEEE Trans. Inf. Theory 48(11), 2847\u20132867 (2002).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"1399_CR8","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":"1399_CR9","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. Inf. Theory 60(9), 5803\u20135804 (2014).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1399_CR10","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"},{"issue":"2","key":"1399_CR11","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(2), 111\u2013147 (1997).","journal-title":"J. Cryptol."},{"issue":"11","key":"1399_CR12","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 value\/magnitude. IEEE Trans. Inf. Theory 57(11), 7597\u20137604 (2011).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"1399_CR13","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":"2","key":"1399_CR14","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s12095-018-0300-y","volume":"11","author":"Y Sun","year":"2019","unstructured":"Sun Y., Wang Q., Yan T.: A lower bound on the 2-adic complexity of the modified Jacobi sequence. Cryptogr. Commun. 11(2), 337\u2013349 (2019).","journal-title":"Cryptogr. Commun."},{"issue":"4","key":"1399_CR15","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(4), 675\u2013683 (2020).","journal-title":"Cryptogr. Commun."},{"issue":"4","key":"1399_CR16","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1007\/s10623-020-00841-9","volume":"89","author":"Y Sun","year":"2021","unstructured":"Sun Y., Yan T., Wang Q.: The 2-adic complexity of Yu\u2013Gong sequences with interleaved structure and optimal autocorrelation magnitude. Des. Codes Cryptogr. 89(4), 695\u2013707 (2021).","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"1399_CR17","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. Inf. Theory 56(3), 1278\u20131286 (2010).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"1399_CR18","doi-asserted-by":"publisher","first-page":"1695","DOI":"10.1007\/s10623-022-01068-6","volume":"90","author":"Y Wang","year":"2022","unstructured":"Wang Y., Han X., Wang W., Heng Z.: Linear complexity over $$\\text{ F}_q$$ and 2-adic complexity of a class of binary generalized cyclotomic sequences with good autocorrelation. Des. Codes Cryptogr. 90(8), 1695\u20131712 (2022).","journal-title":"Des. Codes Cryptogr."},{"issue":"5","key":"1399_CR19","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1007\/s12095-021-00498-8","volume":"13","author":"Z Xiao","year":"2021","unstructured":"Xiao Z., Zeng X.: 2-Adic complexity of two constructions of binary sequences with period 4N and optimal autocorrelation magnitude. Cryptogr. Commun. 13(5), 865\u2013885 (2021).","journal-title":"Cryptogr. Commun."},{"key":"1399_CR20","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2022088","author":"Z Xiao","year":"2022","unstructured":"Xiao Z., Zeng X., Ke M.: On the symmetric 2-adic complexity of periodic binary sequences. Adv. Math. Commun. (2022). https:\/\/doi.org\/10.3934\/amc.2022088.","journal-title":"Adv. Math. Commun."},{"issue":"7","key":"1399_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. Int. J. Found. Comput. Sci. 27(7), 879\u2013893 (2016).","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"4","key":"1399_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 2-adic complexity of binary sequences. IEEE Trans. Inf. Theory 60(4), 2399\u20132406 (2014).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1399_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 Appl. 33, 14\u201328 (2015).","journal-title":"Finite Fields Appl."},{"issue":"1","key":"1399_CR24","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s12095-020-00451-1","volume":"13","author":"M Yan","year":"2021","unstructured":"Yan M., Yan T., Li Y.: Computing the 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences of periods of twin prime products. Cryptogr. Commun. 13(1), 15\u201326 (2021).","journal-title":"Cryptogr. Commun."},{"issue":"10","key":"1399_CR25","doi-asserted-by":"publisher","first-page":"4771","DOI":"10.1109\/TIT.2008.928999","volume":"54","author":"N Yu","year":"2008","unstructured":"Yu N., Gong G.: New binary sequences with optimal autocorrelation magnitude. IEEE Trans. Inf. Theory 54(10), 4771\u20134779 (2008).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"1399_CR26","doi-asserted-by":"publisher","first-page":"4613","DOI":"10.1109\/TIT.2020.2964171","volume":"66","author":"L Zhang","year":"2020","unstructured":"Zhang L., Zhang J., Yang M., Feng K.: On the 2-adic complexity of the Ding-Helleseth-Martinsen binary sequences. IEEE Trans. Inf. Theory 66(7), 4613\u20134620 (2020).","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01399-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-024-01399-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01399-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T16:11:23Z","timestamp":1723219883000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-024-01399-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,16]]},"references-count":26,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["1399"],"URL":"https:\/\/doi.org\/10.1007\/s10623-024-01399-6","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2024,4,16]]},"assertion":[{"value":"7 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 March 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 March 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2024","order":4,"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 no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}