{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T15:35:41Z","timestamp":1774020941097,"version":"3.50.1"},"reference-count":20,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["2020ZYGXZR079"],"award-info":[{"award-number":["2020ZYGXZR079"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11971175"],"award-info":[{"award-number":["11971175"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12171162"],"award-info":[{"award-number":["12171162"]}],"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":[[2022,5]]},"DOI":"10.1109\/tit.2022.3148185","type":"journal-article","created":{"date-parts":[[2022,1,31]],"date-time":"2022-01-31T22:21:51Z","timestamp":1643667711000},"page":"3028-3033","source":"Crossref","is-referenced-by-count":11,"title":["Improved Singleton Bound on Insertion-Deletion Codes and Optimal Constructions"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5295-8403","authenticated-orcid":false,"given":"Bocong","family":"Chen","sequence":"first","affiliation":[{"name":"School of Mathematics, South China University of Technology, Guangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7087-8316","authenticated-orcid":false,"given":"Guanghui","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, Luoyang Normal University, Luoyang, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SPIRE.2000.878178"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01390767"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.3115\/1075218.1075255"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2017.8278045"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3065618"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055498"},{"key":"ref7","first-page":"76:1","article-title":"Synchronization strings: List decoding for insertions and deletions","volume-title":"Proc. 45th Int. Colloq. Automata, Languages Program. (ICALP)","author":"Haeupler"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/322033.322044"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2688361"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2021.101841"},{"key":"ref11","volume-title":"The Theory Error-Correcting Codes","author":"MacWilliams","year":"1983"},{"issue":"1","key":"ref12","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":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.896889"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.3115\/1075096.1075117"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1515\/9783110198119.273"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-006-9032-7"},{"issue":"3","key":"ref17","first-page":"288","article-title":"Codes which correct single asymmetric errors","volume":"161","author":"Varshamov","year":"1965","journal-title":"Autom. Telemkhanika"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-7865-4_24"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2005.845141"},{"issue":"1","key":"ref20","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\/9760494\/09698210.pdf?arnumber=9698210","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T23:28:32Z","timestamp":1705534112000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9698210\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5]]},"references-count":20,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.2022.3148185","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5]]}}}