{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T12:39:46Z","timestamp":1766579986515,"version":"3.37.3"},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"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":["2020YFA0712100","2018YFA0704703"],"award-info":[{"award-number":["2020YFA0712100","2018YFA0704703"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11971325","12231014"],"award-info":[{"award-number":["11971325","12231014"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Beijing Scholars Program"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1109\/tit.2022.3226296","type":"journal-article","created":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T20:50:36Z","timestamp":1669927836000},"page":"2969-2982","source":"Crossref","is-referenced-by-count":10,"title":["Correcting Two-Deletion With a Constant Number of Reads"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2045-4603","authenticated-orcid":false,"given":"Yubo","family":"Sun","sequence":"first","affiliation":[{"name":"School of Mathematical Sciences, Capital Normal University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1535-0754","authenticated-orcid":false,"given":"Gennian","family":"Ge","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, Capital Normal University, Beijing, China"}]}],"member":"263","reference":[{"key":"ref13","first-page":"298","article-title":"Asymptotically optimum binary code with correction for losses of one or two adjacent bits","volume":"19","author":"levenshtein","year":"1970","journal-title":"Syst Theory Res"},{"key":"ref12","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":"ref15","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.2000.3081"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.904499"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3069446"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2876281"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1126\/science.1226355"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2746566"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1126\/science.1145799"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.4079"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2649493"},{"key":"ref18","article-title":"Sequence reconstruction problem for deletion channels: A complete asymptotic solution","author":"pham","year":"2021","journal-title":"arXiv 2111 04255"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3177169"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3028702"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2016.2537305"},{"key":"ref25","article-title":"Non-binary codes for correcting a burst of at most t deletions","author":"wang","year":"2022","journal-title":"arXiv 2210 11818"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2017.8335392"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849750"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2950290"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1038\/nature11875"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3122798"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2800044"},{"key":"ref4","first-page":"279","article-title":"Optimal reconstruction codes for deletion channels","author":"chrisnata","year":"2020","journal-title":"Proc Int Symp Inf Theory Appl (ISITA)"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2807480"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3184868"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518269"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10106509\/09968271.pdf?arnumber=9968271","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T18:42:27Z","timestamp":1683571347000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9968271\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5]]},"references-count":26,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.2022.3226296","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2023,5]]}}}