{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T18:02:33Z","timestamp":1755799353845,"version":"3.44.0"},"reference-count":16,"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.8988926","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":1,"title":["An Explicit Construction of Optimal Streaming Codes for Channels with Burst and Arbitrary Erasures"],"prefix":"10.1109","author":[{"given":"Damian","family":"Dudzicz","sequence":"first","affiliation":[{"name":"EPF Lausanne,Switzerland,CH-1015 Lausanne"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Silas L.","family":"Fong","sequence":"additional","affiliation":[{"name":"University of Toronto,Toronto,Canada,ON M5S 3G4"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashish","family":"Khisti","sequence":"additional","affiliation":[{"name":"University of Toronto,Toronto,Canada,ON M5S 3G4"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Maximum rank distance codes are generic, gabidulin codes are not","author":"horlemann-trautmann","year":"2016","journal-title":"Network Coding and Designs"},{"key":"ref11","first-page":"40","article-title":"Construction of new mds codes from gabidulin codes","author":"berger","year":"2009","journal-title":"Proc ACC"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2017042"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8988926"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1971.1090719"},{"key":"ref15","article-title":"Low field-size, rateoptimal streaming codes for channels with burst and random erasures","author":"krishnan","year":"2019","journal-title":"arXiv preprint arXiv 1903 00066"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989375"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6567095"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.834844"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437570"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437832"},{"journal-title":"The Theory of Error-Correcting Codes","year":"1988","author":"macwilliams","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2618924"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2005.1497853"},{"journal-title":"Recommendation G 114","year":"2003","key":"ref1"},{"key":"ref9","first-page":"1","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Probl Inf Transm"}],"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\/08988926.pdf?arnumber=8988926","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T18:11:52Z","timestamp":1755627112000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8988926\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/itw44776.2019.8988926","relation":{},"subject":[],"published":{"date-parts":[[2019,8]]}}}