{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T08:06:10Z","timestamp":1779782770423,"version":"3.53.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T00:00:00Z","timestamp":1745971200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T00:00:00Z","timestamp":1745971200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1007\/s00200-025-00686-6","type":"journal-article","created":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T00:20:07Z","timestamp":1745972407000},"page":"757-781","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Constructions of divisible difference sets, almost difference sets and special partial direct product difference sets from binary sequences"],"prefix":"10.1007","volume":"37","author":[{"given":"Yan","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Danyang","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nian","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiayi","family":"Fan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,4,30]]},"reference":[{"key":"686_CR1","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1002\/sapm1933121311","volume":"12","author":"REAC Paley","year":"1933","unstructured":"Paley, R.E.A.C.: On orthogonal matrices. J. Math. Phys. 12, 311\u2013320 (1933)","journal-title":"J. Math. Phys."},{"key":"686_CR2","doi-asserted-by":"publisher","first-page":"4229","DOI":"10.1109\/TIT.2006.880058","volume":"52","author":"C Ding","year":"2006","unstructured":"Ding, C.: Complex codebooks from combinatorial designs. IEEE Trans. Inform. Theory 52, 4229\u20134235 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"686_CR3","doi-asserted-by":"publisher","first-page":"978","DOI":"10.1109\/TIT.2022.3203380","volume":"69","author":"Z Heng","year":"2023","unstructured":"Heng, Z.: Projective linear codes from some almost difference sets. IEEE Trans. Inform. Theory 69, 978\u2013994 (2023)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"686_CR4","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1007\/s12095-018-0330-5","volume":"11","author":"Y Li","year":"2019","unstructured":"Li, Y., Yan, T., Lv, C.: Construction of a near-optimal quasi-complementary sequence set from almost difference set. Cryptogr. Commun. 11, 815\u2013824 (2019)","journal-title":"Cryptogr. Commun."},{"key":"686_CR5","doi-asserted-by":"crossref","unstructured":"Li, Y., Xu, C., Peng, X.: More quasi-complementary sequence sets from difference sets and almost difference sets. In 2019 Ninth international workshop on signal design and its applications in communications (IWSDA). IEEE, 1-5 (2019)","DOI":"10.1109\/IWSDA46143.2019.8966099"},{"key":"686_CR6","unstructured":"Michel, J., Ding, B.: A generalization of combinatorial designs related to almost difference sets. Mathematics (2015)"},{"key":"686_CR7","doi-asserted-by":"publisher","first-page":"1945","DOI":"10.1007\/s10623-018-00596-4","volume":"87","author":"J Michel","year":"2019","unstructured":"Michel, J., Wang, Q.: Almost designs and their links with balanced incomplete block designs. Designs, Codes Crytography 87, 1945\u20131960 (2019)","journal-title":"Designs, Codes Crytography"},{"key":"686_CR8","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-level autocorrelation. IEEE Trans. Inform. Theory 47, 428\u2013433 (2001)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"686_CR9","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/BF01194853","volume":"59","author":"JA Davis","year":"1992","unstructured":"Davis, J.A.: Almost difference sets and reversible divisible difference sets. Arch. Math. 59, 595\u2013602 (1992)","journal-title":"Arch. Math."},{"key":"686_CR10","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":"686_CR11","doi-asserted-by":"publisher","first-page":"2052","DOI":"10.1109\/TIT.2006.872969","volume":"52","author":"Y Zhang","year":"2006","unstructured":"Zhang, Y., Lei, J.G., Zhang, S.P.: A new family of almost difference sets and some necessary conditions. IEEE Trans. Inform. Theory 52, 2052\u20132061 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"686_CR12","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/s10623-012-9789-9","volume":"72","author":"C Ding","year":"2014","unstructured":"Ding, C., Pott, A., Wang, Q.: Constructions of almost difference sets from finite fields. Des. Codes Cryptogr. 72, 581\u2013592 (2014)","journal-title":"Des. Codes Cryptogr."},{"key":"686_CR13","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. Theoret. Comput. Sci. 410, 2316\u20132322 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"686_CR14","unstructured":"Nowak, K.: A survey on almost difference sets. arxiv: Combinatorics (2014)"},{"key":"686_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546907","volume-title":"Signal Design for Good Correlation for Wireless Communication, Cryptography, and Radar","author":"SW Golomb","year":"2005","unstructured":"Golomb, S.W., Gong, G.: Signal Design for Good Correlation for Wireless Communication, Cryptography, and Radar. Camridge University Press, Cambridge (2005)"},{"key":"686_CR16","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1080\/09720529.2008.10698187","volume":"11","author":"Y Kumar","year":"2008","unstructured":"Kumar, Y., Pillai, N.R.: On shift sequences for interleaved construction of signal sets with low correlation. J. Discrete Math. Sci. Cryptograph. 11, 319\u2013331 (2008)","journal-title":"J. Discrete Math. Sci. Cryptograph."},{"key":"686_CR17","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, 4771\u20134779 (2008)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"686_CR18","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.1109\/TIT.2009.2039159","volume":"56","author":"XH Tang","year":"2010","unstructured":"Tang, X.H., 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":"686_CR19","doi-asserted-by":"publisher","first-page":"1381","DOI":"10.1049\/el.2010.2135","volume":"46","author":"PH Ke","year":"2010","unstructured":"Ke, P.H., Lin, F.C.: Constructions of binary sequences with optimal autocorrelation value. Electron. Lett. 46, 1381\u20131382 (2010)","journal-title":"Electron. Lett."},{"key":"686_CR20","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":"686_CR21","first-page":"15","volume":"1","author":"SL Ma","year":"2009","unstructured":"Ma, S.L., Ng, W.S.: On non-existence of perfect and nearly perfect sequences. Int. J. Inf. Coding Theory 1, 15\u201338 (2009)","journal-title":"Int. J. Inf. Coding Theory"},{"key":"686_CR22","doi-asserted-by":"publisher","first-page":"401","DOI":"10.3934\/amc.2016014","volume":"10","author":"O Yayla","year":"2016","unstructured":"Yayla, O.: Nearly perfect sequences with arbitrary out-of-phase autocorrelation. Adv. Math. Commun. 10, 401\u2013411 (2016)","journal-title":"Adv. Math. Commun."},{"key":"686_CR23","doi-asserted-by":"publisher","first-page":"1057","DOI":"10.1007\/s12095-020-00423-5","volume":"12","author":"B \u00d6zden","year":"2020","unstructured":"\u00d6zden, B., Yayla, O.: Almost $$p$$-ary sequences. Cryptogr. Commun. 12, 1057\u20131069 (2020)","journal-title":"Cryptogr. Commun."},{"key":"686_CR24","doi-asserted-by":"publisher","first-page":"572","DOI":"10.3934\/amc.2021010","volume":"17","author":"B \u00d6zden","year":"2023","unstructured":"\u00d6zden, B., Yayla, O.: Partial direct product difference sets and almost quaternary sequences. Adv. Math. Commun. 17, 572\u2013588 (2023)","journal-title":"Adv. Math. Commun."},{"key":"686_CR25","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":"686_CR26","first-page":"546","volume":"19","author":"R Meng","year":"2017","unstructured":"Meng, R., Yan, T.: New constructions of binary interleaved sequences with low autocorrelation. Int. J. Netw. Secur. 19, 546\u2013550 (2017)","journal-title":"Int. J. Netw. Secur."}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-025-00686-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00200-025-00686-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-025-00686-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T07:46:56Z","timestamp":1779781616000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00200-025-00686-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,30]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["686"],"URL":"https:\/\/doi.org\/10.1007\/s00200-025-00686-6","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,30]]},"assertion":[{"value":"1 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 November 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 April 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}