{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:55:52Z","timestamp":1773377752353,"version":"3.50.1"},"reference-count":35,"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"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834766","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"2934-2939","source":"Crossref","is-referenced-by-count":9,"title":["Adversarial Torn-paper Codes"],"prefix":"10.1109","author":[{"given":"Daniella","family":"Bar-Lev","sequence":"first","affiliation":[{"name":"Technion—Israel Institute of Technology,Department of Computer Science,Haifa,Israel,3200003"}]},{"given":"Sagi","family":"Marcovich","sequence":"additional","affiliation":[{"name":"Technion—Israel Institute of Technology,Department of Computer Science,Haifa,Israel,3200003"}]},{"given":"Eitan","family":"Yaakobi","sequence":"additional","affiliation":[{"name":"Technion—Israel Institute of Technology,Department of Computer Science,Haifa,Israel,3200003"}]},{"given":"Yonatan","family":"Yehezkeally","sequence":"additional","affiliation":[{"name":"Technical University of Munich,Institute for Communications Engineering,Munich,Germany,80333"}]}],"member":"263","reference":[{"key":"ref33","article-title":"The DNA Storage Channel: Capacity and Error Probability","author":"weinberger","year":"2021"},{"key":"ref32","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":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM42002.2020.9348147"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541609"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611486"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/602421.602426"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth.2474"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1126\/science.1226355"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"950","DOI":"10.1126\/science.aaj2038","article-title":"DNA fountain enables a robust and efficient storage architecture","volume":"355","author":"erlich","year":"2017","journal-title":"Science"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2935973"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541302"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1038\/nature11875"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/anie.201411378"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007106"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989388"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2873138"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282589"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/140962486"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth0210-105"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513668"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834766"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849789"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2219495"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-14-S5-S18"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2954679.2872397"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057242"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1969.1054237"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.2645"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth.3444"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2270273"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620505"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.4079"},{"key":"ref23","article-title":"Reassembly codes for the chop-and-shuffle channel","author":"nassirpour","year":"2022"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2022.3151737"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518272"}],"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\/09834766.pdf?arnumber=9834766","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:04Z","timestamp":1773347704000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834766\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834766","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}