{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:56:46Z","timestamp":1773377806994,"version":"3.50.1"},"reference-count":11,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"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":[[2020,6]]},"DOI":"10.1109\/isit44484.2020.9173977","type":"proceedings-article","created":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T17:28:01Z","timestamp":1598290081000},"page":"84-89","source":"Crossref","is-referenced-by-count":4,"title":["Explicit and Efficient Constructions of Coding Schemes for the Binary Deletion Channel"],"prefix":"10.1109","author":[{"given":"Roni","family":"Con","sequence":"first","affiliation":[{"name":"Tel Aviv University,Blavatnik School of Computer Science,Tel Aviv,Israel,6997801"}]},{"given":"Amir","family":"Shpilka","sequence":"additional","affiliation":[{"name":"Tel Aviv University,Blavatnik School of Computer Science,Tel Aviv,Israel,6997801"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2010.020110.00079"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1214\/08-PS141"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055498"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513746"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2659765"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2980024.2872397"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034177"},{"key":"ref7","article-title":"Explicit and efficient constructions of coding schemes for the binary deletion channel and the poisson repeat channel","author":"con","year":"2019","journal-title":"arXiv preprint arXiv 1909 01771"},{"key":"ref2","article-title":"Polynomial time decodable codes for the binary deletion channel","author":"guruswami","year":"2018","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188768"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881844"}],"event":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","location":"Los Angeles, CA, USA","start":{"date-parts":[[2020,6,21]]},"end":{"date-parts":[[2020,6,26]]}},"container-title":["2020 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9166581\/9173928\/09173977.pdf?arnumber=9173977","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:13Z","timestamp":1773347713000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9173977\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/isit44484.2020.9173977","relation":{},"subject":[],"published":{"date-parts":[[2020,6]]}}}