{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:36:29Z","timestamp":1773376589711,"version":"3.50.1"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100010002","name":"Ministry of Education","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100010002","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206509","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"2726-2731","source":"Crossref","is-referenced-by-count":1,"title":["Non-binary Codes Correcting Two Deletions"],"prefix":"10.1109","author":[{"given":"Wentu","family":"Song","sequence":"first","affiliation":[{"name":"Singapore University of Technology and Design,Science, Mathematics and Technology Cluster,Singapore,487372"}]},{"given":"Kui","family":"Cai","sequence":"additional","affiliation":[{"name":"Singapore University of Technology and Design,Science, Mathematics and Technology Cluster,Singapore,487372"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3177169"},{"key":"ref12","article-title":"Optimal Systematic t-Deletion Correcting Codes","author":"sima","year":"2020","journal-title":"Proc ISIT"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056962"},{"key":"ref14","article-title":"Bounds for deletion\/insertion correcting codes","author":"levenshtein","year":"2002","journal-title":"Proc ISIT"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517917"},{"key":"ref11","article-title":"Syndrome Compression for Optimal Redundancy Codes","author":"sima","year":"2020","journal-title":"Proc ISIT"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3028702"},{"key":"ref21","article-title":"Non-binary Two-Deletion Correcting Codes and Burst-Deletion Correcting Codes","author":"song","year":"2022"},{"key":"ref2","first-page":"845","article-title":"Binary codes capable of correcting deletions, insertions and reversals (in Russian)","volume":"163","author":"levenshtein","year":"1965","journal-title":"Doklady Akademii Nauk SSR"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-019-45832-6"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2541139"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2011.6089584"},{"key":"ref19","article-title":"Optimal codes correcting a single indel\/edit for DNA-based data storage","author":"cai","year":"2019"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174241"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3069446"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2950290"},{"key":"ref9","article-title":"Optimal k-Deletion Correcting Codes","author":"sima","year":"2019","journal-title":"Proc ISIT"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.971760"},{"key":"ref3","first-page":"288","article-title":"Codes which correct single asymmetric errors (in Russian)","volume":"161","author":"varshamov","year":"1965","journal-title":"Automatika i Telemkhanika"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2876281"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2746566"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206509.pdf?arnumber=10206509","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:26:42Z","timestamp":1773347202000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206509\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206509","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}