{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T15:56:31Z","timestamp":1787759791151,"version":"build-2784847793"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["1191077"],"award-info":[{"award-number":["1191077"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Key Research and Development Project","award":["2019YFB1803102"],"award-info":[{"award-number":["2019YFB1803102"]}]},{"name":"Guangdong Key Laboratory of Aerospace Communication and Network Technology Funds","award":["210625"],"award-info":[{"award-number":["210625"]}]},{"DOI":"10.13039\/501100011291","name":"National Key Laboratory of Science and Technology on Communications","doi-asserted-by":"publisher","award":["G02214307"],"award-info":[{"award-number":["G02214307"]}],"id":[{"id":"10.13039\/501100011291","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Key Research and Development Projects","award":["2021YFE0109900"],"award-info":[{"award-number":["2021YFE0109900"]}]},{"name":"National Key Research and Development Projects","award":["2020YFA0712300"],"award-info":[{"award-number":["2020YFA0712300"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12031011"],"award-info":[{"award-number":["12031011"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1109\/tit.2022.3199503","type":"journal-article","created":{"date-parts":[[2022,8,24]],"date-time":"2022-08-24T19:31:14Z","timestamp":1661369474000},"page":"928-940","source":"Crossref","is-referenced-by-count":20,"title":["Bounds and Constructions for Insertion and Deletion Codes"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7709-4223","authenticated-orcid":false,"given":"Shu","family":"Liu","sequence":"first","affiliation":[{"name":"National Key Laboratory of Science and Technology on Communications, University of Electronic Science and Technology of China, Chengdu, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1257-1033","authenticated-orcid":false,"given":"Chaoping","family":"Xing","sequence":"additional","affiliation":[{"name":"School of Electronic Information and Electrical Engineering, Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316529836"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557110"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BF01390767"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2746566"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.3115\/1075218.1075255"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2017.8278045"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2022.3148185"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00028"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1090\/surv\/006"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2023.3237711"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3065618"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2010.5592743"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3056317"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055498"},{"key":"ref16","article-title":"Synchronization strings: List decoding for insertions and deletions","volume-title":"Proc. 45th Int. Colloq. Automata, Lang. Program. (ICALP)","author":"Haeupler"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2688361"},{"key":"ref18","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"},{"issue":"4","key":"ref19","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":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023642"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2021.101841"},{"issue":"1","key":"ref22","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1023\/A:1008212622423","article-title":"Existence of perfect 3-deletion-correcting codes","volume":"14","author":"Mahmoodi","year":"1998","journal-title":"Des., Codes Cryptogr."},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.896889"},{"key":"ref24","volume-title":"The Theory UF Error-Correcting Codes","author":"MacWilliams","year":"1979"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.3115\/1075096.1075117"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-44993-5_6"},{"issue":"1","key":"ref27","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1023\/A:1016562821812","article-title":"Existence of perfect 4-deletion-correcting codes with length six","volume":"27","author":"Shalaby","year":"2002","journal-title":"Des., Codes Cryptogr."},{"issue":"5","key":"ref28","first-page":"363","article-title":"On maximal systems of k-tuples","volume":"1","author":"Sch\u00f6nheim","year":"1966","journal-title":"Studia Scient. Malh. Hungar."},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849750"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9173986"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1515\/9783110198119.273"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056962"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-006-9032-7"},{"issue":"3","key":"ref34","first-page":"288","article-title":"Codes which correct single asymmetric errors (in Russian)","volume":"161","author":"Varshamov","year":"1965","journal-title":"Automatika Telemkhanika"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-7865-4_24"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2005.845141"},{"issue":"1","key":"ref37","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1023\/A:1011271920403","article-title":"A combinatorial construction for perfect deletion-correcting codes","volume":"23","author":"Yin","year":"2001","journal-title":"Des., Codes Cryptogr."}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10024105\/09866718.pdf?arnumber=9866718","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,14]],"date-time":"2024-03-14T03:33:42Z","timestamp":1710387222000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9866718\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2]]},"references-count":37,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2022.3199503","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2]]}}}