{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T14:16:51Z","timestamp":1772893011628,"version":"3.50.1"},"reference-count":25,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2018YFA0902600"],"award-info":[{"award-number":["2018YFA0902600"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100016804","name":"Shenzhen Fundamental Research Programs","doi-asserted-by":"publisher","award":["20200925154814002"],"award-info":[{"award-number":["20200925154814002"]}],"id":[{"id":"10.13039\/100016804","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1109\/tit.2022.3167845","type":"journal-article","created":{"date-parts":[[2022,4,18]],"date-time":"2022-04-18T20:20:07Z","timestamp":1650313207000},"page":"5154-5164","source":"Crossref","is-referenced-by-count":13,"title":["<i>Q<\/i>-Ary Non-Overlapping Codes: A Generating Function Approach"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6262-7464","authenticated-orcid":false,"given":"Geyang","family":"Wang","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, Southern University of Science and Technology, Research Institute of Trustworthy Autonomous Systems, Shenzhen, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9780-5443","authenticated-orcid":false,"given":"Qi","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, National Center for Applied Mathematics Shenzhen, Southern University of Science and Technology, Shenzhen, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1956.1056809"},{"issue":"12","key":"ref2","first-page":"125","article-title":"Decoding automata which are invariant with respect to their initial state","author":"Levenshtein","year":"1964","journal-title":"Problems Cybern."},{"issue":"4","key":"ref3","first-page":"355","article-title":"Maximum number of words in codes without overlaps","volume":"6","author":"Levenshtein","year":"1970","journal-title":"Problems Inform. Transmiss."},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1002\/jcd.10071"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1960.1057587"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2252952"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/26.891223"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2004.1312542"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2189479"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2456634"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1051\/ita\/2016008"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2873138"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1038\/srep14138"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546853"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9781139195768"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s12095-013-0088-8"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s12095-014-0105-6"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-015-0225-2"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129515000067"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2742506"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s12095-017-0251-8"},{"issue":"2","key":"ref22","first-page":"129","article-title":"Solving generalized Fibonacci recurrences","volume":"36","author":"Wolfram","year":"1998","journal-title":"Fibonacci Quart."},{"key":"ref23","volume-title":"Complex Analysis","volume":"2","author":"Stein","year":"2003"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511801655"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.05.009"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9829223\/09758795.pdf?arnumber=9758795","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T22:15:16Z","timestamp":1705961716000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9758795\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8]]},"references-count":25,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tit.2022.3167845","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8]]}}}