{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T05:39:08Z","timestamp":1768714748674,"version":"3.49.0"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T00:00:00Z","timestamp":1654041600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T00:00:00Z","timestamp":1654041600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T00:00:00Z","timestamp":1654041600000},"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) through the European Union\u2019s 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"}]},{"DOI":"10.13039\/100011102","name":"Institute for Advanced Studies, Technical University of Munich, funded by the German Excellence Initiative and European Union Seventh Framework Programme","doi-asserted-by":"publisher","award":["291763"],"award-info":[{"award-number":["291763"]}],"id":[{"id":"10.13039\/100011102","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1109\/tit.2022.3152398","type":"journal-article","created":{"date-parts":[[2022,2,16]],"date-time":"2022-02-16T20:41:14Z","timestamp":1645044074000},"page":"3767-3779","source":"Crossref","is-referenced-by-count":6,"title":["Multiple Criss-Cross Insertion and Deletion Correcting Codes"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5135-6731","authenticated-orcid":false,"given":"Lorenz","family":"Welter","sequence":"first","affiliation":[{"name":"Institute for Communications Engineering, Technical University of Munich (TUM), Munich, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4421-1024","authenticated-orcid":false,"given":"Rawad","family":"Bitar","sequence":"additional","affiliation":[{"name":"Institute for Communications Engineering, Technical University of Munich (TUM), Munich, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5174-1947","authenticated-orcid":false,"given":"Antonia","family":"Wachter-Zeh","sequence":"additional","affiliation":[{"name":"Institute for Communications Engineering, Technical University of Munich (TUM), Munich, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9851-5234","authenticated-orcid":false,"given":"Eitan","family":"Yaakobi","sequence":"additional","affiliation":[{"name":"Computer Science Department, Technion—Israel Institute of Technology, Haifa, Israel"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517743"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-019-45832-6"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2552175"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5707079"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2466635"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2279674"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034196"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.892776"},{"issue":"4","key":"ref9","first-page":"845","article-title":"Binary codes capable of correcting deletions, insertions and reversals","volume":"163","author":"Levenshtein","year":"1965","journal-title":"Doklady Akademii Nauk SSR"},{"issue":"3","key":"ref10","first-page":"288","article-title":"Codes which correct single asymmetric errors (in Russian)","volume":"161","author":"Varshamov","year":"1965","journal-title":"Automatika Telemkhanika"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2659765"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2746566"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2841936"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2876281"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2950290"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3028702"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3069446"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9173986"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3066010"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2661747"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2017.2649492"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518145"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/18.75248"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-008-9185-7"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2000.866405"},{"issue":"3","key":"ref26","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":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/18.841187"},{"issue":"2","key":"ref28","first-page":"103","article-title":"Optimum codes correcting lattice errors","volume":"21","author":"Gabidulin","year":"1985","journal-title":"Problems Inf. Transmiss."},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/18.623142"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2622283"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3111450"},{"key":"ref32","first-page":"304","article-title":"Criss-cross deletion correcting codes","volume-title":"Proc. Int. Symp. Inf. Theory Appl. (ISITA)","author":"Bitar"},{"key":"ref33","first-page":"274","article-title":"Conversion method from erasure codes to multi-deletion error-correcting codes for information in array design","volume-title":"Proc. Int. Symp. Inf. Theory Appl. (ISITA)","author":"Hagiwara"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2257917"},{"issue":"1","key":"ref35","first-page":"3","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"Gabidulin","year":"1985","journal-title":"Problemy Peredachi Informatsii"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9778940\/09715100.pdf?arnumber=9715100","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T22:56:54Z","timestamp":1705532214000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9715100\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6]]},"references-count":35,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2022.3152398","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6]]}}}