{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:54:19Z","timestamp":1740131659730,"version":"3.37.3"},"reference-count":22,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"KIOXIA Corporation"},{"name":"JSPS KAKENHI, Grant-in-Aid for Scientific Research","award":["18H01435"],"award-info":[{"award-number":["18H01435"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1109\/tit.2020.3016261","type":"journal-article","created":{"date-parts":[[2020,8,12]],"date-time":"2020-08-12T21:04:02Z","timestamp":1597266242000},"page":"3315-3321","source":"Crossref","is-referenced-by-count":0,"title":["Perfect Multi Deletion Codes Achieve the Asymptotic Optimality of Code Size"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6448-8293","authenticated-orcid":false,"given":"Takehiko","family":"Mori","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7256-269X","authenticated-orcid":false,"given":"Manabu","family":"Hagiwara","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1023\/A:1016562821812"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011271920403"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.878237"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-008-9212-8"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-010-9376-x"},{"key":"ref15","first-page":"273","article-title":"On single-deletion-correcting codes","volume":"10","author":"sloane","year":"2002","journal-title":"CODES02"},{"key":"ref16","first-page":"293","article-title":"Asymptotically optimum binary code with correction for losses of one or two adjacent bits","volume":"19","author":"levenshtein","year":"1967","journal-title":"Problemy Kibernet"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2661747"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006867"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006602"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1587\/comex.2015XBL0182"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2174961"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849750"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437868"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF01390767"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1515\/dma.1992.2.3.241"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.971760"},{"key":"ref1","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":"ref9","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008212622423"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849783"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2020.111852"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849583"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9437276\/09165812.pdf?arnumber=9165812","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:54:18Z","timestamp":1652194458000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9165812\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6]]},"references-count":22,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2020.3016261","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2021,6]]}}}