{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T14:16:41Z","timestamp":1772893001655,"version":"3.50.1"},"reference-count":17,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada (NSERC) Discovery","doi-asserted-by":"publisher","award":["RGPIN-03882"],"award-info":[{"award-number":["RGPIN-03882"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1109\/tit.2023.3304712","type":"journal-article","created":{"date-parts":[[2023,8,14]],"date-time":"2023-08-14T17:48:24Z","timestamp":1692035304000},"page":"2479-2490","source":"Crossref","is-referenced-by-count":9,"title":["Constructions and Bounds for Codes With Restricted Overlaps"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0762-031X","authenticated-orcid":false,"given":"Simon R.","family":"Blackburn","sequence":"first","affiliation":[{"name":"Department of Mathematics, Royal Holloway, University of London, Egham, U.K"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8146-3450","authenticated-orcid":false,"given":"Navid Nasr","family":"Esfahani","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Memorial University of Newfoundland, St. John’s, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donald L.","family":"Kreher","sequence":"additional","affiliation":[{"name":"Department of Mathematical Sciences, Michigan Technological University, Houghton, MI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5635-8122","authenticated-orcid":false,"given":"Douglas R.","family":"Stinson","sequence":"additional","affiliation":[{"name":"David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s12095-017-0251-8"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2742506"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2189479"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2456634"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2252952"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875032"},{"issue":"4","key":"ref7","article-title":"A simplified Binet formula for k-generalized Fibonacci numbers","volume":"17","author":"Dresden","year":"2014","journal-title":"J. Integer Seq."},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1960.1057587"},{"key":"ref9","first-page":"125","article-title":"Decoding automata which are invariant with respect to their initial state","volume":"12","author":"Levenshtein","year":"1964","journal-title":"Problems Cybern."},{"issue":"4","key":"ref10","first-page":"845","article-title":"Binary codes capable of correcting deletions, insertions and reversals","volume":"163","author":"Levenshtein","year":"1965","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"ref11","first-page":"298","article-title":"Asymptotically optimum binary codes with correction for losses of one or two adjacent bits","volume":"19","author":"Levenshtein","year":"1970","journal-title":"Syst. Theory Res."},{"issue":"4","key":"ref12","first-page":"88","article-title":"Maximal number of words in codes without overlap","volume":"6","author":"Levenshtein","year":"1970","journal-title":"Problems Inf. Transmiss."},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2873138"},{"key":"ref14","volume-title":"Fibonacci N-Step Number,\u2019 From MathWorld\u2014A Wolfram Web Resource","author":"Noe","year":"2023"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2661747"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2792488"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3167845"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10475890\/10216374.pdf?arnumber=10216374","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,26]],"date-time":"2024-03-26T17:50:15Z","timestamp":1711475415000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10216374\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4]]},"references-count":17,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tit.2023.3304712","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4]]}}}