{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T18:00:18Z","timestamp":1755799218520,"version":"3.44.0"},"reference-count":7,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"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,8]]},"DOI":"10.1109\/itw44776.2019.8989375","type":"proceedings-article","created":{"date-parts":[[2020,2,10]],"date-time":"2020-02-10T22:18:26Z","timestamp":1581373106000},"page":"1-5","source":"Crossref","is-referenced-by-count":19,"title":["An Explicit Rate-Optimal Streaming Code for Channels with Burst and Arbitrary Erasures"],"prefix":"10.1109","author":[{"given":"Elad","family":"Domanovitz","sequence":"first","affiliation":[{"name":"Tel Aviv University,School of Electrical Engineering,Tel Aviv-Yafo,Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Silas L.","family":"Fong","sequence":"additional","affiliation":[{"name":"University of Toronto,Department of Electrical and Computer Engineering,Toronto,Canada,ON M5S 3G4"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashish","family":"Khisti","sequence":"additional","affiliation":[{"name":"University of Toronto,Department of Electrical and Computer Engineering,Toronto,Canada,ON M5S 3G4"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437570"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2894124"},{"key":"ref6","article-title":"Low field-size, rate-optimal streaming codes for channels with burst and random erasures","volume":"abs 1903 6210","author":"krishnan","year":"2019","journal-title":"CoRR"},{"key":"ref5","article-title":"An explicit construction of optimal streaming codes for channels with burst and arbitrary erasures","volume":"abs 1903 7434","author":"dudzicz","year":"2019","journal-title":"CoRR"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2618924"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6567095"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.834844"}],"event":{"name":"2019 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2019,8,25]]},"location":"Visby, Sweden","end":{"date-parts":[[2019,8,28]]}},"container-title":["2019 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8968650\/8988913\/08989375.pdf?arnumber=8989375","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T18:11:58Z","timestamp":1755627118000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8989375\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":7,"URL":"https:\/\/doi.org\/10.1109\/itw44776.2019.8989375","relation":{},"subject":[],"published":{"date-parts":[[2019,8]]}}}