{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:56:25Z","timestamp":1773377785114,"version":"3.50.1"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834565","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"1004-1009","source":"Crossref","is-referenced-by-count":9,"title":["List-decodable Codes for Single-deletion Single-substitution with List-size Two"],"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"}]},{"given":"Tuan Thanh","family":"Nguyen","sequence":"additional","affiliation":[{"name":"Singapore University of Technology and Design,Science, Mathematics and Technology Cluster,Singapore,487372"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3028702"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9173986"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3069446"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3066430"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3122798"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174213"},{"key":"ref16","article-title":"Systematic singledeletion multiple-substitution correcting codes","author":"song","year":"2020"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517878"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2659765"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2777471"},{"key":"ref4","article-title":"Beyond singledeletion correcting codes: substitutions and transpositions","author":"gabrys","year":"2021"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3049627"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2746566"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.971760"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2950290"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2876281"},{"key":"ref2","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":"ref1","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":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849750"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2981321"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3096154"},{"key":"ref21","article-title":"Synchronization strings: list decoding for insertions and deletions","author":"haeupler","year":"2018","journal-title":"Proc 45th Int Colloq Automata Lang Program (ICALP)"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834565"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834565.pdf?arnumber=9834565","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:08Z","timestamp":1773347708000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834565\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834565","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}