{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:59:17Z","timestamp":1773377957379,"version":"3.50.1"},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"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":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849647","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"1372-1376","source":"Crossref","is-referenced-by-count":31,"title":["Coding for Deletion Channels with Multiple Traces"],"prefix":"10.1109","author":[{"given":"Mahed","family":"Abroshan","sequence":"first","affiliation":[{"name":"University of Cambridge"}]},{"given":"Ramji","family":"Venkataramanan","sequence":"additional","affiliation":[{"name":"University of Cambridge"}]},{"given":"Lara","family":"Dolecek","sequence":"additional","affiliation":[{"name":"ECE Department, UCLA"}]},{"given":"Albert Guill\u00e9n","family":"i F\u00e0bregas","sequence":"additional","affiliation":[{"name":"ICREA & Universitat Pompeu Fabra, University of Cambridge"}]}],"member":"263","reference":[{"key":"ref10","first-page":"288","article-title":"Codes which correct single asymmetric errors","volume":"26","author":"varshamov","year":"1965","journal-title":"Automatica i Telemekhanica"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056962"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.651063"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437715"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849647"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.29"},{"key":"ref3","article-title":"Trace reconstruction with constant deletion probability and related results","author":"holenstein","year":"2008","journal-title":"Proc ACM-SIAM SODA"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2800044"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437519"},{"key":"ref8","article-title":"Unique reconstruction of coded strings from multiset substring spectra","author":"gabrys","year":"2018","journal-title":"Proc IEEE ISIT"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2649493"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.904499"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2555321"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2014.6970811"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849647.pdf?arnumber=8849647","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:40Z","timestamp":1773347740000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849647\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849647","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}