{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:38:05Z","timestamp":1773376685477,"version":"3.50.1"},"reference-count":23,"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 Research and Development Program of China","doi-asserted-by":"publisher","award":["2020YFA0712100,2022YFA1004900,2021YFA1001000"],"award-info":[{"award-number":["2020YFA0712100,2022YFA1004900,2021YFA1001000"]}],"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":["12231014"],"award-info":[{"award-number":["12231014"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Shandong Provincial Natural Science Foundation","doi-asserted-by":"publisher","award":["ZR2021YQ46"],"award-info":[{"award-number":["ZR2021YQ46"]}],"id":[{"id":"10.13039\/501100007129","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.10619104","type":"proceedings-article","created":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T13:25:01Z","timestamp":1724073901000},"page":"1107-1112","source":"Crossref","is-referenced-by-count":1,"title":["Improving the Singleton-Type Upper Bounds for Non-Linear Deletion Correcting Codes"],"prefix":"10.1109","author":[{"given":"Shiqin","family":"Liu","sequence":"first","affiliation":[{"name":"School of Cyber Science and Technology, Shandong University,Key Laboratory of Cryptologic Technology and Information Security of Ministry of Education,Qingdao,Shandong,China,266237"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Cyber Science and Technology, Shandong University,Key Laboratory of Cryptologic Technology and Information Security of Ministry of Education,Qingdao,Shandong,China,266237"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gennian","family":"Ge","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, Capital Normal University,Beijing,China,100048"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiwei","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Cyber Science and Technology, Shandong University,Key Laboratory of Cryptologic Technology and Information Security of Ministry of Education,Qingdao,Shandong,China,266237"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"issue":"4","key":"ref1","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 SSR"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.971760"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00028"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3069446"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9173986"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3177169"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3304565"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056962"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2541139"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF01390767"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011271920403"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048492"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023642"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.55630\/sjc.2007.1.13-26"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2257917"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2317698"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3285012"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3199503"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3148185"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3167662"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3234967"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-023-01342-1"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.2000.3081"}],"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\/10619104.pdf?arnumber=10619104","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:27:41Z","timestamp":1773347261000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10619104\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,7]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/isit57864.2024.10619104","relation":{},"subject":[],"published":{"date-parts":[[2024,7,7]]}}}