{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:42:10Z","timestamp":1773376930302,"version":"3.50.1"},"reference-count":30,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Union","doi-asserted-by":"publisher","award":["10115134"],"award-info":[{"award-number":["10115134"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195607","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":3,"title":["Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-1\/2 Codes"],"prefix":"10.1109","author":[{"given":"Peter","family":"Beelen","sequence":"first","affiliation":[{"name":"Technical University of Denmark,Denmark"}]},{"given":"Roni","family":"Con","sequence":"additional","affiliation":[{"name":"Technion - Israel Institute of Technology,Israel"}]},{"given":"Anina","family":"Gruica","sequence":"additional","affiliation":[{"name":"Technical University of Denmark,Denmark"}]},{"given":"Maria","family":"Montanucci","sequence":"additional","affiliation":[{"name":"Technical University of Denmark,Denmark"}]},{"given":"Eitan","family":"Yaakobi","sequence":"additional","affiliation":[{"name":"Technion - Israel Institute of Technology,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-Solomon codes achieve the half-singleton bound for insertions and deletions over linearsized alphabets","author":"Con","year":"2024","journal-title":"arXiv preprint"},{"key":"ref12","first-page":"707710","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"10","author":"Levenshtein","year":"1966","journal-title":"Soviet physics 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.1137\/21M142798X"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/isit63088.2025.11195607"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-09519-5_73"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322225"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3199503"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195607.pdf?arnumber=11195607","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:24Z","timestamp":1773347364000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195607\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195607","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}