{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T21:13:36Z","timestamp":1784236416904,"version":"3.55.0"},"reference-count":10,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,11,10]],"date-time":"2024-11-10T00:00:00Z","timestamp":1731196800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,11,10]],"date-time":"2024-11-10T00:00:00Z","timestamp":1731196800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,11,10]]},"DOI":"10.23919\/isita60732.2024.10858234","type":"proceedings-article","created":{"date-parts":[[2025,2,3]],"date-time":"2025-02-03T18:24:59Z","timestamp":1738607099000},"page":"389-394","source":"Crossref","is-referenced-by-count":1,"title":["The Tight Upper Bound for the Size of Single Deletion Error Correcting Codes of Length 11"],"prefix":"10.23919","author":[{"given":"Kazuhisa","family":"Nakasho","sequence":"first","affiliation":[{"name":"Graduate School of Science and Technology for Innovation, Yamaguchi University,Ube,Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Manabu","family":"Hagiwara","sequence":"additional","affiliation":[{"name":"Graduate School of Science, Chiba University,Chiba,Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Austin","family":"Anderson","sequence":"additional","affiliation":[{"name":"Kapi'olani Community College,Math and Sciences,Honolulu,United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J. B.","family":"Nation","sequence":"additional","affiliation":[{"name":"University of Hawaii,Department of Mathematics,Honolulu,United States"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.3390\/e21121202"},{"key":"ref2","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"10","author":"Levenshtein","year":"1966","journal-title":"Sov. Phys. Dokl."},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023642"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1515\/9783110198119.273"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2257917"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2317698"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-98096-6_12"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.09.023"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3355502"},{"key":"ref10","first-page":"597","article-title":"Formalization of VT codes and their single-deletion correcting property in Lean","volume-title":"2020 International Symposium on Information Theory and Its Applications (ISITA)","author":"Kondo","year":"2020"}],"event":{"name":"2024 International Symposium on Information Theory and Its Applications (ISITA)","location":"Taipei, Taiwan","start":{"date-parts":[[2024,11,10]]},"end":{"date-parts":[[2024,11,13]]}},"container-title":["2024 International Symposium on Information Theory and Its Applications (ISITA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10858199\/10858201\/10858234.pdf?arnumber=10858234","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T18:30:10Z","timestamp":1738693810000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10858234\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,10]]},"references-count":10,"URL":"https:\/\/doi.org\/10.23919\/isita60732.2024.10858234","relation":{},"subject":[],"published":{"date-parts":[[2024,11,10]]}}}