{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:40:40Z","timestamp":1773376840258,"version":"3.50.1"},"reference-count":20,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"publisher","award":["2020YFA0712300"],"award-info":[{"award-number":["2020YFA0712300"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,7,7]]},"DOI":"10.1109\/isit57864.2024.10619335","type":"proceedings-article","created":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T13:25:01Z","timestamp":1724073901000},"page":"1095-1100","source":"Crossref","is-referenced-by-count":0,"title":["Improved Non-Asymptotic Lower Bound on the Size of Optimal Insertion\/Deletion Correcting Code"],"prefix":"10.1109","author":[{"given":"P.","family":"Yuhang","sequence":"first","affiliation":[{"name":"Academy of Mathematics and Systems Science, Chinese Academy of Sciences,Beijing,China,100190"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhifang","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, University of Chinese Academy of Sciences,Beijing,China,100049"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaqian","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Electronic Information and Electrical Engineering, Shanghai Jiao Tong University,Shanghai,China,200240"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3227128"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.256522"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3069446"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206888"},{"issue":"1","key":"ref5","first-page":"123","article-title":"Tight bounds on the number of string subsequences","volume":"1","author":"Hirschberg","year":"2000","journal-title":"J. Discrete Algorithms"},{"issue":"8","key":"ref6","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"10","author":"Levenshtein","year":"1966","journal-title":"Soviet Phys. Doklady"},{"key":"ref7","first-page":"207","article-title":"Elements of coding theory","author":"Levenshtein","year":"1974","journal-title":"Discrete Mathemat-ics and Mathematical Problems of Cybernetics, Nauka, Moscow"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1515\/dma.1992.2.3.241"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023642"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2413958"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3199503"},{"key":"ref12","first-page":"139","article-title":"Non-binary code capable of correcting deletions of single symbols","author":"Maksimov","year":"1978","journal-title":"Modelling and Management in Evolving Systems, Nauka, Moscow"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620761"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2014.6970810"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3028702"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3177169"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056962"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/18.623158"},{"issue":"2","key":"ref19","first-page":"288","article-title":"Codes which correct single asymmetric errors","volume":"26","author":"Varshamov","year":"1965","journal-title":"Avtomatica i Telemekhanika"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-023-01342-1"}],"event":{"name":"2024 IEEE International Symposium on Information Theory (ISIT)","location":"Athens, Greece","start":{"date-parts":[[2024,7,7]]},"end":{"date-parts":[[2024,7,12]]}},"container-title":["2024 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10619013\/10619074\/10619335.pdf?arnumber=10619335","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:28:40Z","timestamp":1773347320000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10619335\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,7]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/isit57864.2024.10619335","relation":{},"subject":[],"published":{"date-parts":[[2024,7,7]]}}}