{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:37:01Z","timestamp":1773376621124,"version":"3.50.1"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"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"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206626","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"927-932","source":"Crossref","is-referenced-by-count":5,"title":["Improved Upper and Lower Bounds on the Capacity of the Binary Deletion Channel"],"prefix":"10.1109","author":[{"given":"Ittai","family":"Rubinstein","sequence":"first","affiliation":[{"name":"QEDMA Quantum Computing Tel Aviv,Israel"}]},{"given":"Roni","family":"Con","sequence":"additional","affiliation":[{"name":"Tel Aviv University,Blavatnik School of Computer Science"}]}],"member":"263","reference":[{"key":"ref13","first-page":"37","article-title":"Coding for noisy channels","volume":"4","author":"elias","year":"1955","journal-title":"IRE Convention Record"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref15","article-title":"Polynomial time decodable codes for the binary deletion channel","author":"guruswami","year":"2018","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.901221"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41598-019-45832-6","article-title":"A characterization of the DNA data storage channel","volume":"9","author":"heckel","year":"2019","journal-title":"Scientific Reports"},{"key":"ref10","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":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2010.020110.00079"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1214\/08-PS141"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3136440"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3148190"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834386"},{"key":"ref18","first-page":"105:1","article-title":"Explicit and efficient construction of nearly optimal rate codes for the binary deletion channel and the poisson repeat channel","author":"rubinstein","year":"0"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206626"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054753"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849608"},{"key":"ref25","author":"wolf","year":"1992","journal-title":"Improving Locality and Parallelism in Nested Loops"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557469"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054855"},{"key":"ref21","author":"yeung","year":"2008","journal-title":"Information Theory and Network Coding"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2368553"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034177"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2980024.2872397"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881844"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2997329"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046210"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034883"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206626.pdf?arnumber=10206626","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:27:01Z","timestamp":1773347221000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206626\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206626","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}