{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,25]],"date-time":"2025-08-25T21:10:15Z","timestamp":1756156215599,"version":"3.44.0"},"reference-count":79,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Union","doi-asserted-by":"crossref","award":["101045114"],"award-info":[{"award-number":["101045114"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1109\/tit.2025.3581849","type":"journal-article","created":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T13:26:38Z","timestamp":1750685198000},"page":"6503-6516","source":"Crossref","is-referenced-by-count":0,"title":["Conditional Entropies of <i>k<\/i>-Deletion\/Insertion Channels"],"prefix":"10.1109","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7684-6307","authenticated-orcid":false,"given":"Shubhransh","family":"Singhvi","sequence":"first","affiliation":[{"name":"International Institute of Information Technology, Hyderabad, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6099-4113","authenticated-orcid":false,"given":"Omer","family":"Sabary","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Technion&#x2014;Israel Institute of Technology, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6766-1450","authenticated-orcid":false,"given":"Daniella","family":"Bar-Lev","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Technion&#x2014;Israel Institute of Technology, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9851-5234","authenticated-orcid":false,"given":"Eitan","family":"Yaakobi","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Technion&#x2014;Israel Institute of Technology, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849647"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517842"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1038\/s41587-019-0240-x"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054753"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-26096-9_33"},{"key":"ref6","article-title":"From clustering supersequences to entropy minimizing subsequences for single and double deletions","author":"Atashpendar","year":"2018","journal-title":"arXiv:1802.00703"},{"key":"ref7","article-title":"A proof of entropy minimization for outputs in deletion channels via hidden word statistics","author":"Atashpendar","year":"2018","journal-title":"arXiv:1807.11609"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517922"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3227128"},{"key":"ref10","article-title":"Deep DNA storage: Scalable and robust DNA storage via coding theory and deep learning","author":"Bar-Lev","year":"2021","journal-title":"arXiv:2109.00031"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517773"},{"key":"ref12","first-page":"910","article-title":"Reconstructing strings from random traces","volume-title":"Proc. ACM-SIAM Symp. Discrete Algorithms (SODA)","author":"Batu"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054855"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch132"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2746566"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3122798"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ITWF.2015.7360727"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00028"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518161"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3281275"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2997329"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3237711"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034177"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517926"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.892776"},{"issue":"4","key":"ref26","first-page":"18","article-title":"Shannon\u2019s theorems for channels with synchronization errors","volume":"3","author":"Dobrushin","year":"1967","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.901221"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046210"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1120582.1120586"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2876281"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2800044"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3202856"},{"article-title":"Sequential decoding for binary channels with noise and synchronization errors","year":"1961","author":"Gallager","key":"ref33"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548314000522"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1002\/anie.201411378"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3069446"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384262"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2659765"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437894"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-019-45832-6"},{"key":"ref41","article-title":"Subpolynomial trace reconstruction for random strings and arbitrary deletion probability","author":"Holden","year":"2018","journal-title":"arXiv:1801.04783"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849427"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513746"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034883"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034883"},{"key":"ref46","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume-title":"Proc. Sov. Phys. Doklady","volume":"10","author":"Levenshtein"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/18.904499"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.2000.3081"},{"key":"ref49","article-title":"On list decoding of insertion and deletion errors","author":"Liu","year":"2019","journal-title":"arXiv:1906.09705"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1214\/08-PS141"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881844"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.4079"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-022-30140-x"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2368553"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2368553"},{"article-title":"Explicit and efficient construction of nearly optimal rate codes for the binary deletion channel and the Poisson repeat channel","volume-title":"Proc. 49th Int. Colloq. Automata, Language, Program. (ICALP)","author":"Rubinstein","key":"ref56"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206626"},{"key":"ref58","article-title":"On the decoding error weight of one or two deletion channels","author":"Sabary","year":"2022","journal-title":"arXiv:2201.02466"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-024-51730-3"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-024-51730-3"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btaa740"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2552175"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1515\/9783110198119.273"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3319088"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2661747"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849750"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3063709"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518244"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/ITW54588.2022.9965878"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619163"},{"key":"ref71","article-title":"Optimally decoding two-dimensional Reed\u2013Solomon codes up to the half-singleton bound","author":"Singhvi","year":"2024","journal-title":"arXiv:2412.20771"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517821"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3177169"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3250459"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-020-15588-z"},{"issue":"2","key":"ref76","first-page":"288","article-title":"A code for correcting a single asymmetric error","volume":"26","author":"Varshamov","year":"1965","journal-title":"Autom. I Telemekhanika"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2777471"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620351"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-017-05188-1"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/11134633\/11048652.pdf?arnumber=11048652","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,25]],"date-time":"2025-08-25T20:44:44Z","timestamp":1756154684000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11048652\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9]]},"references-count":79,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tit.2025.3581849","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2025,9]]}}}