{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,11]],"date-time":"2026-09-11T15:56:48Z","timestamp":1789142208913,"version":"build-2803163510"},"reference-count":26,"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"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,7,7]]},"DOI":"10.1109\/isit57864.2024.10619103","type":"proceedings-article","created":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T13:25:01Z","timestamp":1724073901000},"page":"1101-1106","source":"Crossref","is-referenced-by-count":7,"title":["New Construction of q-ary Codes Correcting a Burst of at Most t 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"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kui","family":"Cai","sequence":"additional","affiliation":[{"name":"Singapore University of Technology and Design,Science, Mathematics and Technology Cluster,Singapore,487372"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tony Q. S.","family":"Quek","sequence":"additional","affiliation":[{"name":"Singapore University of Technology and Design,Information Systems Technology and Design Pillar,Singapore,487372"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"issue":"4","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":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056962"},{"key":"ref3","volume-title":"A New Version of q-ary Varshamov-Tenengolts Codes with more Efficient Encoders: The Differ-ential VT Codes and The Differential Shifted VT Codes","author":"Nguyen","year":"2023"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2746566"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3069446"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3028702"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9173986"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3069446"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174241"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518196"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3177169"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3285012"},{"key":"ref13","volume-title":"Explicit Construction of q-ary 2-deletion Correcting Codes with Low Redundancy","author":"Liu","year":"2023"},{"key":"ref14","first-page":"293","article-title":"Asymptotically optimum binary code with correction for losses of one or two adjacent bits","volume":"19","author":"Levenshtein","year":"1967","journal-title":"Problemy Kibernetiki"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875032"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2661747"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2778143"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174288"},{"key":"ref19","volume-title":"Nonbinary codes for correcting a burst of at most t deletions","author":"Wang","year":"2022"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174009"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2010.100209"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3066430"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3279766"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3122798"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3250459"},{"key":"ref26","doi-asserted-by":"crossref","DOI":"10.1109\/ISIT57864.2024.10619103","volume-title":"New Construction of q-ary Codes Correcting a Burst of at most t Deletions","author":"Song","year":"2024"}],"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\/10619103.pdf?arnumber=10619103","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:28:24Z","timestamp":1773347304000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10619103\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,7]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/isit57864.2024.10619103","relation":{},"subject":[],"published":{"date-parts":[[2024,7,7]]}}}