{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:43:43Z","timestamp":1773377023596,"version":"3.50.1"},"reference-count":46,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195439","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Near Optimal Code Construction for the Adversarial Torn Paper Channel with Edit Errors"],"prefix":"10.1109","author":[{"given":"Maria","family":"Abu-Sini","sequence":"first","affiliation":[{"name":"Technical University of Munich,Munich,DE,Germany,80333"}]},{"given":"Reinhard","family":"Heckel","sequence":"additional","affiliation":[{"name":"Technical University of Munich,Munich,DE,Germany,80333"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619700"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3292895"},{"issue":"4","key":"ref3","first-page":"41","article-title":"New upper bounds for error correcting codes","volume":"1","author":"Bassalygo","year":"1965","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(76)90055-1"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-14-S5-S18"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3561046"},{"key":"ref7","volume-title":"List decoding for noisy channels","author":"Elias","year":"1957"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3092056"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90235-A"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2935973"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541302"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1960.1057587"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1039\/D4DD00220B"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/b104335"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00029"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2981321"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007106"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498448"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057714"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1963.1057841"},{"key":"ref21","first-page":"125","article-title":"Decoding automata which are invariant with respect to their initial state (in Russian)","volume":"12","author":"Levenshtein","year":"1964","journal-title":"Problems of Cybernetic"},{"key":"ref22","first-page":"355","article-title":"Maximum number of words in codes without overlaps","volume":"6","author":"Levenshtein","year":"1970","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1002\/jcd.10071"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2873138"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1038\/s42003-022-04062-9"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2270273"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620505"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2023.3335409"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2020.3035370"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185373"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518272"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2022.3151737"},{"key":"ref33","volume-title":"Recovering a message from an incomplete set of noisy fragments","author":"Ravi","year":"2024"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3063709"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849789"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541609"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3120920"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(80)90044-1"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2777471"},{"key":"ref40","volume-title":"Break-resilient codes for forensic 3D fingerprinting","author":"Wang","year":"2023"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619135"},{"key":"ref42","volume-title":"Secure Information embedding and extraction in forensic 3D fingerprinting","author":"Wang","year":"2024"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3454119"},{"key":"ref44","volume-title":"List decoding","author":"Wozencraft","year":"1958"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3269124"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611486"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195439.pdf?arnumber=11195439","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:30:06Z","timestamp":1773347406000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195439\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":46,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195439","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}