{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:59:49Z","timestamp":1773377989139,"version":"3.50.1"},"reference-count":25,"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.9834379","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"360-365","source":"Crossref","is-referenced-by-count":1,"title":["Coding for Trace Reconstruction over Multiple Channels with Vanishing Deletion Probabilities"],"prefix":"10.1109","author":[{"given":"Serge Kas","family":"Hanna","sequence":"first","affiliation":[{"name":"Technical University of Munich,Institute for Communications Engineering,Germany"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055494"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975062.6"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.29"},{"key":"ref13","article-title":"Subpolynomial trace reconstruction for random strings and arbitrary deletion probability","author":"holden","year":"2018","journal-title":"arXiv preprint arXiv 1801 04144"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1126\/science.1226355"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1038\/nature11875"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41598-017-05188-1","article-title":"Portable and error-free dna-based data storage","volume":"7","author":"yazdi","year":"2017","journal-title":"Scientific Reports"},{"key":"ref17","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":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849647"},{"key":"ref19","first-page":"286","article-title":"Correction code for single asymmetric errors","volume":"26","author":"varshamov","year":"1965","journal-title":"Automat Telemekh"},{"key":"ref4","first-page":"910","article-title":"Reconstructing strings from random traces","author":"batu","year":"2004","journal-title":"Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms SODA ’04"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2996377"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.2000.3081"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.904499"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44777-2_57"},{"key":"ref7","first-page":"389","article-title":"Trace reconstruction with constant deletion probability and related results","volume":"8","author":"holenstein","year":"2008","journal-title":"SODA"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541778"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055450"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1226355"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00052"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517773"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437519"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518064"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517926"},{"key":"ref25","article-title":"Coding for trace reconstruction over multiple channels with vanishing deletion probabilities","author":"kas hanna","year":"0","journal-title":"Extended Version"}],"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\/09834379.pdf?arnumber=9834379","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:48Z","timestamp":1773347748000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834379\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834379","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}