{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T14:16:45Z","timestamp":1772893005509,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,6,25]],"date-time":"2024-06-25T00:00:00Z","timestamp":1719273600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,25]],"date-time":"2024-06-25T00:00:00Z","timestamp":1719273600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"NSF-BSF","award":["CCF2110113"],"award-info":[{"award-number":["CCF2110113"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12371522"],"award-info":[{"award-number":["12371522"]}],"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":[[2025,4]]},"DOI":"10.1007\/s10623-024-01445-3","type":"journal-article","created":{"date-parts":[[2024,6,25]],"date-time":"2024-06-25T08:02:44Z","timestamp":1719302564000},"page":"871-878","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On the maximum size of variable-length non-overlapping codes"],"prefix":"10.1007","volume":"93","author":[{"given":"Geyang","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qi","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,25]]},"reference":[{"key":"1445_CR1","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s12095-013-0088-8","volume":"6","author":"D Bajic","year":"2014","unstructured":"Bajic D., Loncar-Turukalo T.: A simple suboptimal construction of cross-bifix-free codes. Cryptogr. Commun. 6, 27\u201337 (2014).","journal-title":"Cryptogr. Commun."},{"key":"1445_CR2","doi-asserted-by":"crossref","unstructured":"Bajic D., Stojanovic J.: Distributed sequences and search process. In: 2004 IEEE International Conference on Communications, vol. 1, pp. 514\u2013518. IEEE (2004).","DOI":"10.1109\/ICC.2004.1312542"},{"issue":"4","key":"1445_CR3","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/s12095-017-0251-8","volume":"10","author":"E Barcucci","year":"2018","unstructured":"Barcucci E., Bernini A., Bilotta S., Pinzani R.: A 2D non-overlapping code over a $$q$$-ary alphabet. Cryptogr. Commun. 10(4), 667\u2013683 (2018).","journal-title":"Cryptogr. Commun."},{"issue":"4","key":"1445_CR4","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s12095-014-0105-6","volume":"6","author":"A Bernini","year":"2014","unstructured":"Bernini A., Bilotta S., Pinzani R., Sabri A., Vajnovszki V.: Prefix partitioned gray codes for particular cross-bifix-free sets. Cryptogr. Commun. 6(4), 359\u2013369 (2014).","journal-title":"Cryptogr. Commun."},{"issue":"2","key":"1445_CR5","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1017\/S0960129515000067","volume":"27","author":"A Bernini","year":"2017","unstructured":"Bernini A., Bilotta S., Pinzani R., Vajnovszki V.: A Gray code for cross-bifix-free sets. Math. Struct. Comput. Sci. 27(2), 184\u2013196 (2017).","journal-title":"Math. Struct. Comput. Sci."},{"issue":"10","key":"1445_CR6","doi-asserted-by":"publisher","first-page":"6530","DOI":"10.1109\/TIT.2017.2742506","volume":"63","author":"S Bilotta","year":"2017","unstructured":"Bilotta S.: Variable-length non-overlapping codes. IEEE Trans. Inform. Theory 63(10), 6530\u20136537 (2017).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"9","key":"1445_CR7","doi-asserted-by":"publisher","first-page":"4890","DOI":"10.1109\/TIT.2015.2456634","volume":"61","author":"SR Blackburn","year":"2015","unstructured":"Blackburn S.R.: Non-overlapping codes. IEEE Trans. Inform. Theory 61(9), 4890\u20134894 (2015).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"1445_CR8","doi-asserted-by":"publisher","first-page":"2479","DOI":"10.1109\/TIT.2023.3304712","volume":"70","author":"SR Blackburn","year":"2024","unstructured":"Blackburn S.R., Esfahan N.N., Kreher D.L., Stinson D.R.: Constructions and bounds for codes with restricted overlaps. IEEE Trans. Inform. Theory 70(4), 2479\u20132490 (2024).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1445_CR9","doi-asserted-by":"publisher","first-page":"4439","DOI":"10.1109\/TIT.2023.3319010","volume":"70","author":"Q Cai","year":"2024","unstructured":"Cai Q., Wang X., Feng T.: Constructions and bounds for $$q$$-ary $$(1, k)$$-overlap-free codes. IEEE Trans. Inform. Theory. 70, 4439\u20134444 (2024).","journal-title":"IEEE Trans. Inform. Theory."},{"issue":"7","key":"1445_CR10","doi-asserted-by":"publisher","first-page":"4668","DOI":"10.1109\/TIT.2013.2252952","volume":"59","author":"YM Chee","year":"2013","unstructured":"Chee Y.M., Kiah H.M., Purkayastha P., Wang C.: Cross-bifix-free codes within a constant factor of optimality. IEEE Trans. Inform. Theory 59(7), 4668\u20134674 (2013).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1445_CR11","volume-title":"Elements of Information Theory","author":"TM Cover","year":"2006","unstructured":"Cover T.M., Thomas J.A.: Elements of Information Theory, 2nd edn Wiley, New York (2006).","edition":"2"},{"key":"1445_CR12","doi-asserted-by":"crossref","unstructured":"De\u00a0Lind\u00a0van Wijngaarden A., Willink T.J.: Frame synchronization using distributed sequences. IEEE Trans. Commun. 48(12), 2127\u20132138 (2000).","DOI":"10.1109\/26.891223"},{"key":"1445_CR13","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1109\/TIT.1960.1057587","volume":"6","author":"EN Gilbert","year":"1960","unstructured":"Gilbert E.N.: Synchronization of binary messages. IRE Trans. Inform. Theory 6, 470\u2013477 (1960).","journal-title":"IRE Trans. Inform. Theory"},{"issue":"1\u20132","key":"1445_CR14","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/S0304-3975(00)00277-2","volume":"262","author":"NH Lam","year":"2001","unstructured":"Lam N.H.: Finite maximal solid codes. Theoret. Comput. Sci. 262(1\u20132), 333\u2013347 (2001).","journal-title":"Theoret. Comput. Sci."},{"key":"1445_CR15","first-page":"125","volume":"12","author":"VI Leven\u0161te\u012dn","year":"1964","unstructured":"Leven\u0161te\u012dn V.I.: Decoding automata which are invariant with respect to the initial state. Problemy Kibernet. 12, 125\u2013136 (1964).","journal-title":"Problemy Kibernet."},{"issue":"4","key":"1445_CR16","first-page":"88","volume":"6","author":"VN Leven\u0161te\u012dn","year":"1970","unstructured":"Leven\u0161te\u012dn V.N.: The maximal number of words in codes without overlap. Problemy Pereda\u010di Informacii 6(4), 88\u201390 (1970).","journal-title":"Problemy Pereda\u010di Informacii"},{"issue":"6","key":"1445_CR17","doi-asserted-by":"publisher","first-page":"3671","DOI":"10.1109\/TIT.2018.2873138","volume":"65","author":"M Levy","year":"2019","unstructured":"Levy M., Yaakobi E.: Mutually uncorrelated codes for DNA storage. IEEE Trans. Inform. Theory 65(6), 3671\u20133691 (2019).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1445_CR18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3354675","author":"C Qin","year":"2024","unstructured":"Qin C., Chen B., Luo G.: Constructions of non-expandable cross-bifix-free codes via expandable codes. IEEE Trans. Inform. Theory. (2024). https:\/\/doi.org\/10.1109\/TIT.2024.3354675.","journal-title":"IEEE Trans. Inform. Theory."},{"issue":"5","key":"1445_CR19","doi-asserted-by":"publisher","first-page":"1299","DOI":"10.1007\/s10623-023-01344-z","volume":"92","author":"L Stanovnik","year":"2024","unstructured":"Stanovnik L., Mo\u0161kon M., Mraz M.: In search of maximum non-overlapping codes. Des. Codes Cryptogr. 92(5), 1299\u20131326 (2024).","journal-title":"Des. Codes Cryptogr."},{"issue":"8","key":"1445_CR20","doi-asserted-by":"publisher","first-page":"5154","DOI":"10.1109\/TIT.2022.3167845","volume":"68","author":"G Wang","year":"2022","unstructured":"Wang G., Wang Q.: $$q$$-ary non-overlapping codes: a generating function approach. IEEE Trans. Inform. Theory 68(8), 5154\u20135164 (2022).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"9","key":"1445_CR21","doi-asserted-by":"publisher","first-page":"6283","DOI":"10.1109\/TIT.2018.2792488","volume":"64","author":"SMHT Yazdi","year":"2018","unstructured":"Yazdi S.M.H.T., Kiah H.M., Gabrys R., Milenkovic O.: Mutually uncorrelated primers for DNA-based data storage. IEEE Trans. Inform. Theory 64(9), 6283\u20136296 (2018).","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01445-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-024-01445-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01445-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,18]],"date-time":"2025-04-18T17:30:33Z","timestamp":1744997433000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-024-01445-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,25]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["1445"],"URL":"https:\/\/doi.org\/10.1007\/s10623-024-01445-3","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,25]]},"assertion":[{"value":"27 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 June 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 June 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 that there are no Conflict of interest that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}