{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:02:37Z","timestamp":1773378157061,"version":"3.50.1"},"reference-count":28,"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"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100011643","name":"Blavatnik Family Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100011643","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834672","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"2940-2945","source":"Crossref","is-referenced-by-count":1,"title":["Reed Solomon Codes Against Adversarial Insertions and Deletions"],"prefix":"10.1109","author":[{"given":"Roni","family":"Con","sequence":"first","affiliation":[{"name":"Tel Aviv University,Blavatnik School of Computer Science,Tel Aviv,Israel,6997801"}]},{"given":"Amir","family":"Shpilka","sequence":"additional","affiliation":[{"name":"Tel Aviv University,Blavatnik School of Computer Science,Tel Aviv,Israel,6997801"}]},{"given":"Itzhak","family":"Tamo","sequence":"additional","affiliation":[{"name":"Tel Aviv University,Department of Electrical Engineering-Systems,Tel Aviv,Israel,6997801"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/358746.358762"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/9780470546345"},{"key":"ref12","first-page":"81","article-title":"Traitor tracing for shortened and corrupted fingerprints","author":"safavi-naini","year":"2002","journal-title":"ACM Workshop on Digital Rights Management"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-7865-4_24"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-006-9032-7"},{"key":"ref15","article-title":"Explicit Constructions of Two-Dimensional Reed-Solomon Codes in High Insertion and Deletion Noise Regime","author":"duc","year":"2019"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2021.101841"},{"key":"ref17","article-title":"Improved Singleton bound on insertion-deletion codes and optimal constructions","author":"chen","year":"2021"},{"key":"ref18","article-title":"Bounds and constructions for insertion and deletion codes","author":"liu","year":"2021"},{"key":"ref19","author":"crochemore","year":"2003","journal-title":"Jewels of stringology text algorithms"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-008-9193-7"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2980024.2872397"},{"key":"ref27","first-page":"43","article-title":"Linear ternary quasiperfect codes correcting double errors","volume":"22","author":"gashkov","year":"1986","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1950.tb00463.x"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41598-019-45832-6","article-title":"A characterization of the DNA data storage channel","volume":"9","author":"heckel","year":"2019","journal-title":"Scientific Reports"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41598-017-05188-1","article-title":"Portable and error-free DNA-based data storage","volume":"7","author":"yazdi","year":"2017","journal-title":"Scientific Reports"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2010.020110.00079"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1214\/08-PS141"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref9","first-page":"59","article-title":"QR code","volume":"2008","author":"soon","year":"2008","journal-title":"Synthesis Journal"},{"key":"ref1","article-title":"Linear and reed solomon codes against adversarial insertions and deletions","author":"con","year":"2021"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.1"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1002\/mana.19821090103"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2766178"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1017\/S0305004117000044","article-title":"An analogue of Vosper’s theorem for extension fields","volume":"163","author":"bachoc","year":"2017","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.2021.1886845"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-16.4.212"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-75245-3_10"}],"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\/09834672.pdf?arnumber=9834672","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:34Z","timestamp":1773347794000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834672\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834672","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}