{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T13:59:52Z","timestamp":1769263192524,"version":"3.49.0"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100008398","name":"Villum Fonden","doi-asserted-by":"publisher","award":["VIL\u201d52303\u201d"],"award-info":[{"award-number":["VIL\u201d52303\u201d"]}],"id":[{"id":"10.13039\/100008398","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000782","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["2462\/24"],"award-info":[{"award-number":["2462\/24"]}],"id":[{"id":"10.13039\/501100000782","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"publisher","award":["DiDAX"],"award-info":[{"award-number":["DiDAX"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"publisher","award":["101115134"],"award-info":[{"award-number":["101115134"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1109\/tit.2025.3647216","type":"journal-article","created":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T18:40:59Z","timestamp":1766428859000},"page":"1149-1160","source":"Crossref","is-referenced-by-count":0,"title":["Reed\u2013Solomon Codes Against Insertions and Deletions: Full-Length and Rate-1\/2 Codes"],"prefix":"10.1109","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1218-2422","authenticated-orcid":false,"given":"Peter","family":"Beelen","sequence":"first","affiliation":[{"name":"Department of Applied Mathematics and Computer Science, Technical University of Denmark, Kongens Lyngby, Denmark"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0966-3818","authenticated-orcid":false,"given":"Roni","family":"Con","sequence":"additional","affiliation":[{"name":"Henry and Marilyn Taub Faculty of Computer Science, Technion—Israel Institute of Technology, Haifa, Israel"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-3066-3223","authenticated-orcid":false,"given":"Anina","family":"Gruica","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics and Computer Science, Technical University of Denmark, Kongens Lyngby, Denmark"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1226-3209","authenticated-orcid":false,"given":"Maria","family":"Montanucci","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics and Computer Science, Technical University of Denmark, Kongens Lyngby, Denmark"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9851-5234","authenticated-orcid":false,"given":"Eitan","family":"Yaakobi","sequence":"additional","affiliation":[{"name":"Henry and Marilyn Taub Faculty of Computer Science, Technion—Israel Institute of Technology, Haifa, Israel"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3237711"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2997329"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3056317"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-44993-5_6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-7865-4_24"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-006-9032-7"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3065618"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2021.101841"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3387848"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3398587"},{"key":"ref11","article-title":"Random Reed\u2013Solomon codes achieve the half-singleton bound for insertions and deletions over linear-sized alphabets","author":"Con","year":"2024","journal-title":"arXiv:2407.07299"},{"key":"ref12","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"10","author":"Levenshtein","year":"1966","journal-title":"Sov. Phys. Doklady"},{"issue":"3","key":"ref13","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":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2876281"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2950290"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2746566"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3028702"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174241"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3069446"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3360964"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3468265"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-023-01342-1"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023642"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557110"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/21M142798X"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3167662"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3234967"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2023008"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3199503"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-09519-5_73"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322225"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/11361350\/11311494.pdf?arnumber=11311494","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T20:58:12Z","timestamp":1769201892000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11311494\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2]]},"references-count":32,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2025.3647216","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2]]}}}