{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T15:35:41Z","timestamp":1774020941087,"version":"3.50.1"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["852953"],"award-info":[{"award-number":["852953"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1030\/15"],"award-info":[{"award-number":["1030\/15"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["514\/20"],"award-info":[{"award-number":["514\/20"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100011643","name":"Len Blavatnik and the Blavatnik Family Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100011643","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1109\/tit.2023.3237711","type":"journal-article","created":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T18:49:46Z","timestamp":1674067786000},"page":"2991-3000","source":"Crossref","is-referenced-by-count":20,"title":["Reed Solomon Codes Against Adversarial Insertions and Deletions"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0966-3818","authenticated-orcid":false,"given":"Roni","family":"Con","sequence":"first","affiliation":[{"name":"Blavatnik School of Computer Science, Tel Aviv University, Tel Aviv, Israel"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2384-425X","authenticated-orcid":false,"given":"Amir","family":"Shpilka","sequence":"additional","affiliation":[{"name":"Blavatnik School of Computer Science, Tel Aviv University, Tel Aviv, Israel"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8000-0419","authenticated-orcid":false,"given":"Itzhak","family":"Tamo","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering-Systems, Tel Aviv University, Tel Aviv, Israel"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004117000044"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2980024.2872397"},{"key":"ref3","article-title":"Improved singleton bound on insertion-deletion codes\n                        and optimal constructions","author":"Chen","year":"2021","journal-title":"arXiv:2105.02004"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.1"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1142\/4838"},{"issue":"1","key":"ref6","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/s10623-008-9193-7","article-title":"A family of ternary quasi-perfect BCH\n                        codes","volume":"49","author":"Danev","year":"2008","journal-title":"Designs, Codes Cryptogr."},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(78)90067-4"},{"key":"ref8","article-title":"Explicit constructions of two-dimensional\n                        Reed\u2013Solomon codes in high insertion and deletion noise\n                        regime","author":"Do Duc","year":"2019","journal-title":"arXiv:1909.03426"},{"key":"ref9","article-title":"Problems and results on 3-chromatic hypergraphs and\n                        some related questions","volume-title":"Colloquia\n                        Mathematica Societatis Janos Bolyai 10, Infinite and Finite Sets","author":"Erdos","year":"1973"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-16.4.212"},{"issue":"4","key":"ref11","first-page":"43","article-title":"Linear ternary quasi-perfect codes correcting double\n                        errors","volume":"22","author":"Gashkov","year":"1986","journal-title":"Problemy Peredachi\n                        Informatsii"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1950.tb00463.x"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-019-45832-6"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2021.101841"},{"key":"ref15","article-title":"Bounds and constructions for insertion and deletion\n                        codes","author":"Liu","year":"2021","journal-title":"arXiv:2111.14026"},{"key":"ref16","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511752490","volume-title":"Diophantine Equations Over Function Fields","author":"Mason","year":"1984"},{"key":"ref17","article-title":"Open problems","volume-title":"Proc. Symp. Analytic Number Theory","author":"Masser"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/358746.358762"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2010.020110.00079"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1214\/08-PS141"},{"issue":"162","key":"ref21","first-page":"165","article-title":"Nouvelles approches du\n                        \u2018th\u00e9oreme\u2019 de fermat","volume":"161","author":"Oesterl\u00e9","year":"1988","journal-title":"Ast\u00e9risque"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-75245-3_10"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2766178"},{"key":"ref24","first-page":"81","article-title":"Traitor tracing for shortened and corrupted\n                        fingerprints","volume-title":"Proc. ACM Workshop Digit.\n                        Rights Manag.","author":"Safavi-Naini"},{"issue":"4","key":"ref25","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1145\/322217.322225","article-title":"Fast probabilistic algorithms for verification of\n                        polynomial identities","volume":"27","author":"Schwartz","year":"1980","journal-title":"J. ACM"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","article-title":"A mathematical theory of\n                        communication","volume":"27","author":"Shannon","year":"1948","journal-title":"Bell Syst. Tech. J."},{"issue":"3","key":"ref27","first-page":"59","article-title":"QR code","volume":"2008","author":"Soon","year":"2008","journal-title":"Synth.\n                        J."},{"issue":"3","key":"ref28","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1093\/qmath\/32.3.349","article-title":"Polynomial identities and\n                    Hauptmoduln","volume":"32","author":"Stothers","year":"1981","journal-title":"Quart. J. Math."},{"issue":"2","key":"ref29","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/s10623-006-9032-7","article-title":"Construction of deletion correcting codes using\n                        generalized Reed\u2013Solomon codes and their\n                    subcodes","volume":"42","author":"Tonien","year":"2007","journal-title":"Des., Codes Cryptogr."},{"issue":"2","key":"ref30","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1081\/AGB-120017341","article-title":"Vanishing polynomial sums","volume":"31","author":"Vaserstein","year":"2003","journal-title":"Commun. Algebra"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/978-3-0348-7865-4_24","article-title":"Deletion correcting using generalized\n                        Reed\u2013Solomon codes","volume-title":"Coding,\n                        Cryptography and Combinatorics","author":"Wang","year":"2004"},{"key":"ref32","doi-asserted-by":"crossref","DOI":"10.1109\/9780470546345","volume-title":"Reed\u2013Solomon Codes and Their Applications","author":"Wicker","year":"1999"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-017-05188-1"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-09519-5_73"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10106509\/10019583.pdf?arnumber=10019583","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T18:03:31Z","timestamp":1742839411000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10019583\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5]]},"references-count":34,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.2023.3237711","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5]]}}}