{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:59:20Z","timestamp":1773377960386,"version":"3.50.1"},"reference-count":31,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"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 (ERC) under the European Union's Horizon 2020 research and innovation programme","doi-asserted-by":"publisher","award":["801434"],"award-info":[{"award-number":["801434"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9517743","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"2798-2803","source":"Crossref","is-referenced-by-count":4,"title":["Multiple Criss-Cross Deletion-Correcting Codes"],"prefix":"10.1109","author":[{"given":"Lorenz","family":"Welter","sequence":"first","affiliation":[{"name":"Technical University of Munich (TUM),Institute for Communications Engineering,Germany"}]},{"given":"Rawad","family":"Bitar","sequence":"additional","affiliation":[{"name":"Technical University of Munich (TUM),Institute for Communications Engineering,Germany"}]},{"given":"Antonia","family":"Wachter-Zeh","sequence":"additional","affiliation":[{"name":"Technical University of Munich (TUM),Institute for Communications Engineering,Germany"}]},{"given":"Eitan","family":"Yaakobi","sequence":"additional","affiliation":[{"name":"CS department of Technion - Israel Institute of Technology,Israel"}]}],"member":"263","reference":[{"key":"ref31","article-title":"Mul-tiple criss-cross deletion-correcting codes","author":"welter","year":"0","journal-title":"Extended Version"},{"key":"ref30","first-page":"3","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Problemy Peredachi Informatsii"},{"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","first-page":"1","article-title":"Two deletion correcting codes from indicator vectors","author":"sima","year":"2019","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref15","first-page":"1","article-title":"On optimal k-deletion correcting codes","author":"sima","year":"2020","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref16","article-title":"Explicit two-deletion codes with redundancy matching the existential bound","author":"guruswami","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9173986"},{"key":"ref18","article-title":"Trace reconstruction: Generalized and parameterized","author":"krishnamurthy","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/18.75248"},{"key":"ref28","article-title":"Conversion method from erasure codes to multi-deletion error-correcting codes for information in array design","author":"hagiwara","year":"0","journal-title":"International Symposium on Information Theory and its Applications (ISITA)"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2466635"},{"key":"ref27","article-title":"Criss-cross deletion correcting codes","author":"bitar","year":"0","journal-title":"International Symposium on Information Theory and its Applications"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5707079"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034196"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2257917"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2279674"},{"key":"ref8","first-page":"845","article-title":"Binary codes capable of correcting deletions, insertions and reversals (in Russian)","volume":"163","author":"levenshtein","year":"1965","journal-title":"Doklady Akademii Nauk SSR"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.892776"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2552175"},{"key":"ref9","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":"ref1","doi-asserted-by":"crossref","first-page":"9663","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":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-008-9185-7"},{"key":"ref22","first-page":"165","article-title":"Class of correcting codes for errors with a lattice configuration","volume":"12","author":"sidorenko","year":"1976","journal-title":"Problemy Reredachi Informatsii"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2000.866405"},{"key":"ref24","first-page":"103","article-title":"Optimum codes correcting lattice errors","volume":"21","author":"gabidulin","year":"1985","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/18.841187"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2622283"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/18.623142"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09517743.pdf?arnumber=9517743","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:40Z","timestamp":1773347740000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9517743\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9517743","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}