{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T23:56:31Z","timestamp":1772927791556,"version":"3.50.1"},"reference-count":21,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2026,3,1]]},"DOI":"10.1587\/transfun.2025eal2050","type":"journal-article","created":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T22:07:32Z","timestamp":1758492452000},"page":"757-762","source":"Crossref","is-referenced-by-count":0,"title":["&lt;i&gt;Q&lt;\/i&gt;-Ary (&lt;i&gt;t&lt;\/i&gt;&lt;sub&gt;1&lt;\/sub&gt;, &lt;i&gt;t&lt;\/i&gt;&lt;sub&gt;2&lt;\/sub&gt;)-Overlap-Free Codes"],"prefix":"10.1587","volume":"E109.A","author":[{"given":"Hui","family":"YANG","sequence":"first","affiliation":[{"name":"Department of Mathematics, Shanghai University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"DING","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Shanghai University"},{"name":"Newtouch Center for Mathematics, Shanghai University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] D. Bajic, \u201cOn construction of cross-bifix-free kernel sets,\u201d 2nd MCM COST, vol.2100, pp.57-58, 2007."},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] D. Bajic and T. Loncar-Turukalo, \u201cA simple suboptimal construction of cross-bifix-free codes,\u201d Cryptogr. Commun., vol.6, pp.27-37, 2014. 10.1007\/s12095-013-0088-8","DOI":"10.1007\/s12095-013-0088-8"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] S. Bilotta, E. Pergola, and R. Pinzani, \u201cA new approach to cross-bifix-free sets,\u201d IEEE Trans. Inf. Theory, vol.58, no.6, pp.4058-4063, 2012. 10.1109\/tit.2012.2189479","DOI":"10.1109\/TIT.2012.2189479"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] S. Bilotta, \u201cVariable-length non-overlapping codes,\u201d IEEE Trans. Inf. Theory, vol.63, no.10, pp.6530-6537, 2017. 10.1109\/tit.2017.2742506","DOI":"10.1109\/TIT.2017.2742506"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] S.R. Blackburn, \u201cNon-overlapping codes,\u201d IEEE Trans. Inf. Theory, vol.61, no.9, pp.4890-4894, 2015. 10.1109\/tit.2015.2456634","DOI":"10.1109\/TIT.2015.2456634"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] S.R. Blackburn, N.N. Esfahani, D.L. Kreher, and D.R. Stinson, \u201cConstructions and bounds for codes with restricted overlaps,\u201d IEEE Trans. Inf. Theory, vol.70, no.4, pp.2479-2490, 2024. 10.1109\/tit.2023.3304712","DOI":"10.1109\/TIT.2023.3304712"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] Q. Cai, X. Wang, and T. Feng, \u201cConstructions and bounds for <i>q<\/i>-ary (1, <i>k<\/i>)-overlap-free codes,\u201d IEEE Trans. Inf. Theory, vol.70, no.6, pp.4439-4444, 2024. 10.1109\/tit.2023.3319010","DOI":"10.1109\/TIT.2023.3319010"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] Y.M. Chee, H.M. Kiah, P. Purkayastha, and C. Wang, \u201cCross-bifix-free codes within a constant factor of optimality,\u201d IEEE Trans. Inf. Theory, vol.59, no.7, pp.4668-4674, 2013. 10.1109\/tit.2013.2252952","DOI":"10.1109\/TIT.2013.2252952"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] P. Flajolet, Analytic Combinatorics, Cambridge University Press, 2009. 10.1017\/CBO9780511801655","DOI":"10.1017\/CBO9780511801655"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] E. Gilbert, \u201cSynchronization of binary messages,\u201d IRE Trans. Inf. Theory, vol.6, no.4, pp.470-477, 1960. 10.1109\/tit.1960.1057587","DOI":"10.1109\/TIT.1960.1057587"},{"key":"11","unstructured":"[11] V.I. Levenshtein, \u201cDecoding automata which are invariant with respect to their initial state,\u201d Probl. Cybern., vol.12, pp.125-136, 1964."},{"key":"12","unstructured":"[12] V.I. Levenshtein, \u201cMaximum number of words in codes without overlaps,\u201d Problemy Peredachi Informatsii, vol.6, no.4, pp.88-90, 1970."},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] M. Levy and E. Yaakobi, \u201cMutually uncorrelated codes for DNA storage,\u201d IEEE Trans. Inf. Theory, vol.65, no.6, pp.3671-3691, 2019. 10.1109\/tit.2018.2873138","DOI":"10.1109\/TIT.2018.2873138"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] C. Qin, B. Chen, and G. Luo, \u201cConstructions of non-expandable cross-bifix-free codes via expandable codes,\u201d IEEE Trans. Inf. Theory, vol.70, no.7, pp.4946-4955, 2024. 10.1109\/tit.2024.3354675","DOI":"10.1109\/TIT.2024.3354675"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] R. Scholtz, \u201cFrame synchronization techniques,\u201d IEEE Trans. Commun., vol.28, no.8, pp.1204-1213, 1980. 10.1109\/tcom.1980.1094813","DOI":"10.1109\/TCOM.1980.1094813"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] G. Wang and Q. Wang, \u201c<i>q<\/i>-ary non-overlapping codes: A generating function approach,\u201d IEEE Trans. Inf. Theory, vol.68, no.8, pp.5154-5164, 2022. 10.1109\/tit.2022.3167845","DOI":"10.1109\/TIT.2022.3167845"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] G. Wang and Q. Wang, \u201cOn the maximum size of variable-length non-overlapping codes,\u201d Des. Codes Cryptogr., vol.93, pp.871-878, 2025. 10.1007\/s10623-024-01445-3","DOI":"10.1007\/s10623-024-01445-3"},{"key":"18","doi-asserted-by":"publisher","unstructured":"[18] X. Wang, Y. Fang, and T. Feng, \u201c<i>q<\/i>-ary (1, <i>k<\/i>)-overlap-free codes with given restrictions,\u201d Discrete Mathematics, vol.348, no.1, p.114236, 2025. 10.1016\/j.disc.2024.114236","DOI":"10.1016\/j.disc.2024.114236"},{"key":"19","doi-asserted-by":"publisher","unstructured":"[19] A.J. de Lind van Wijngaarden and T.J. Willink, \u201cFrame synchronization using distributed sequences,\u201d IEEE Trans. Commun., vol.48, no.12, pp.2127-2138, 2000. 10.1109\/26.891223","DOI":"10.1109\/26.891223"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[20] D.A. Wolfram, \u201cSolving generalized Fibonacci recurrences,\u201d The Fibonacci Quarterly, vol.36, no.2, pp.129-145, 1998. 10.1080\/00150517.1998.12428948","DOI":"10.1080\/00150517.1998.12428948"},{"key":"21","doi-asserted-by":"publisher","unstructured":"[21] S.M.H.T. Yazdi, H.M. Kiah, R. Gabrys, and O. Milenkovic, \u201cMutually uncorrelated primers for DNA-based data storage,\u201d IEEE Trans. Inf. Theory, vol.64, no.9, pp.6283-6296, 2018. 10.1109\/tit.2018.2792488","DOI":"10.1109\/TIT.2018.2792488"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E109.A\/3\/E109.A_2025EAL2050\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T04:11:13Z","timestamp":1772856673000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E109.A\/3\/E109.A_2025EAL2050\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,1]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2025eal2050","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,1]]},"article-number":"2025EAL2050"}}