{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:43:28Z","timestamp":1773377008706,"version":"3.50.1"},"reference-count":26,"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"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195209","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":0,"title":["Improved Constructions of Linear Codes for Insertions and Deletions"],"prefix":"10.1109","author":[{"given":"Roee","family":"Gross","sequence":"first","affiliation":[{"name":"Technion—Israel Institute of Technology,Department of Computer Science,Haifa,Israel,3200003"}]},{"given":"Roni","family":"Con","sequence":"additional","affiliation":[{"name":"Technion—Israel Institute of Technology,Department of Computer Science,Haifa,Israel,3200003"}]},{"given":"Eitan","family":"Yaakobi","sequence":"additional","affiliation":[{"name":"Technion—Israel Institute of Technology,Department of Computer Science,Haifa,Israel,3200003"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1950.tb00463.x"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1214\/08-PS141"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2010.020110.00079"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2997329"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3056317"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557110"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3167662"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3173185"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2023.3237711"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3234967"},{"key":"ref13","article-title":"Linear insertion deletion codes in the high-noise and high-rate regimes","author":"Cheng","year":"2023","journal-title":"arXiv preprint"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3387848"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3398587"},{"key":"ref16","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":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3173185"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557110"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1002\/mana.19821090103"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/18.57204"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/18.490540"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-76878-4"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.132"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3056317"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055498"}],"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\/11195209.pdf?arnumber=11195209","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:59Z","timestamp":1773347399000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195209\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195209","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}