{"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":1773377989348,"version":"3.50.1"},"reference-count":49,"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"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9517773","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"1847-1852","source":"Crossref","is-referenced-by-count":5,"title":["Decoding for Optimal Expected Normalized Distance over the t-Deletion Channel"],"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":"Yotam","family":"Gershon","sequence":"additional","affiliation":[{"name":"Technion - Israel Institute of Technology,Department of Electrical Engineering,Haifa,Israel,3200003"}]},{"given":"Omer","family":"Sabary","sequence":"additional","affiliation":[{"name":"University of California San Diego,Department of Electrical and Computer Engineering,La Jolla,CA,USA,92093"}]},{"given":"Eitan","family":"Yaakobi","sequence":"additional","affiliation":[{"name":"Technion - Israel Institute of Technology,Department of Computer Science,Haifa,Israel,3200003"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2552175"},{"key":"ref38"},{"key":"ref33","article-title":"Scaling up DNA data storage and random access retrieval","author":"organick","year":"2017","journal-title":"BioRxiv"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881844"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1214\/08-PS141"},{"key":"ref30","author":"liu","year":"2019","journal-title":"On list decoding of insertion and deletion errors"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174488"},{"key":"ref36","article-title":"SOLQC: Synthetic oligo library quality control Tool","author":"sabary","year":"2019","journal-title":"BioRxiv"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1186\/gb-2013-14-5-r51"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2368553"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth.2918"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034883"},{"key":"ref29","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":"ref2","article-title":"From clustering supersequences to entropy minimizing subsequences for single and double deletions","author":"atashpendar","year":"2018","journal-title":"ArXiv Preprint"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849647"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3069446"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2659765"},{"key":"ref21","first-page":"524","article-title":"Optimally resilient codes for list-decoding from insertions and deletions","author":"guruswami","year":"0","journal-title":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437894"},{"key":"ref23","author":"haeupler","year":"2018","journal-title":"Synchronization strings List decoding for insertions and deletions"},{"key":"ref26","first-page":"2374","article-title":"List decoding of deletions using guess & check codes","author":"kas hanna","year":"0","journal-title":"Int Symp Inform Theory"},{"key":"ref25","article-title":"A characterization of the DNA data storage channel","author":"heckel","year":"2018","journal-title":"arxiv org\/pdf\/1803 03322 pdf"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3281275"},{"key":"ref11","author":"con","year":"2019","journal-title":"Explicit and efficient constructions of coding schemes for the binary deletion channel and the Poisson repeat channel"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849750"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034177"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864445"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.892776"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.901221"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.08.035"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046210"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2876281"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548314000522"},{"key":"ref4","first-page":"1011","article-title":"Forward error correction for DNA data storage","volume":"80","author":"blawat","year":"0","journal-title":"Int Conf on Computational Science"},{"key":"ref3","author":"bar-lev","year":"2021","journal-title":"The error probability of maximum likelihood decoding for the t-deletion channel"},{"key":"ref6","author":"briffa","year":"2018","journal-title":"Time-varying block codes for synchronization errors MAP decoder and practical issues"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch132"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3030569"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2621044"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.3389\/fbioe.2014.00049"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ITWF.2015.7360727"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2278181"},{"key":"ref45","first-page":"288","volume":"26","author":"varshamov","year":"1965","journal-title":"A code for correcting a single asymmetric error Automatica i Telemekhanika"},{"key":"ref48","doi-asserted-by":"crossref","first-page":"5011","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":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2777471"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437519"},{"key":"ref41","author":"sima","year":"2018","journal-title":"On coding over sliced information"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849705"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3033513"}],"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\/09517773.pdf?arnumber=9517773","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:47Z","timestamp":1773347747000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9517773\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":49,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9517773","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}