{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:03:02Z","timestamp":1773378182214,"version":"3.50.1"},"reference-count":23,"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\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100011102","name":"Seventh Framework Programme","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100011102","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.9834350","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"814-819","source":"Crossref","is-referenced-by-count":1,"title":["Equivalence of Insertion\/Deletion Correcting Codes for d-dimensional Arrays"],"prefix":"10.1109","author":[{"given":"Evagoras","family":"Stylianou","sequence":"first","affiliation":[{"name":"Technical University of Munich,Ece Department"}]},{"given":"Lorenz","family":"Welter","sequence":"additional","affiliation":[{"name":"Technical University of Munich,Ece Department"}]},{"given":"Rawad","family":"Bitar","sequence":"additional","affiliation":[{"name":"Technical University of Munich,Ece Department"}]},{"given":"Antonia","family":"Wachter-Zeh","sequence":"additional","affiliation":[{"name":"Technical University of Munich,Ece Department"}]},{"given":"Eitan","family":"Yaakobi","sequence":"additional","affiliation":[{"name":"Israel Institute of Technology,CS Department of Technion"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2659765"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2746566"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2841936"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2876281"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2950290"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3028702"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.2"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9173986"},{"key":"ref18","article-title":"Trace reconstruction: Generalized and parametrized","author":"krishnamurthy","year":"2019","journal-title":"European Symposium on Algorithms"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518145"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2552175"},{"key":"ref3","article-title":"Coding for the correction of synchronization errors","author":"helberg","year":"1993","journal-title":"PhD thesis"},{"key":"ref6","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"10","author":"levenshtein","year":"1966","journal-title":"Soviet Physics Doklady"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2807480"},{"key":"ref8","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":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2317698"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-14-272"},{"key":"ref1","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":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056962"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3111450"},{"key":"ref22","article-title":"Conversion method from erasure codes to multi-deletion error-correcting codes for information in array design","author":"hagiwara","year":"2020","journal-title":"International Symposium on Information Theory and its Applications (ISITA)"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517903"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3152398"}],"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\/09834350.pdf?arnumber=9834350","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:40Z","timestamp":1773347800000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834350\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834350","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}