{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:19:53Z","timestamp":1761293993738,"version":"3.37.3"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1109\/tcomm.2019.2944372","type":"journal-article","created":{"date-parts":[[2019,9,28]],"date-time":"2019-09-28T02:45:25Z","timestamp":1569638725000},"page":"12-25","source":"Crossref","is-referenced-by-count":18,"title":["An Explicit Construction of Optimal Streaming Codes for Channels With Burst and Arbitrary Erasures"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2339-4060","authenticated-orcid":false,"given":"Damian","family":"Dudzicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8762-5294","authenticated-orcid":false,"given":"Silas L.","family":"Fong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2331-8965","authenticated-orcid":false,"given":"Ashish","family":"Khisti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541831"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849250"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2445753"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.110514"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CWIT.2013.6621611"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2011.6189949"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620379"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2663110"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8635971"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541433"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2016005"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928291"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6567095"},{"key":"ref27","article-title":"Systematic encoders for generalized Gabidulin codes and the q-analogue of Cauchy matrices","author":"neri","year":"2018","journal-title":"arXiv 1805 06706"},{"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":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2016.2639062"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437832"},{"key":"ref8","article-title":"An explicit rate-optimal streaming code for channels with burst and arbitrary erasures","author":"domanovitz","year":"2019","journal-title":"arXiv 1904 06212"},{"key":"ref7","article-title":"Low field-size, rate-optimal streaming codes for channels with burst and random erasures","author":"krishnan","year":"2019","journal-title":"arXiv 1903 06210"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2005.1497853"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2827367"},{"journal-title":"One-Way Transmission Time","year":"2003","key":"ref1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2016.02.034"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1971.1090719"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2618924"},{"key":"ref24","first-page":"1","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Problems Inf Transmiss"},{"journal-title":"The Theory of Error-Correcting Codes","year":"1988","author":"macwilliams","key":"ref23"},{"key":"ref26","first-page":"40","article-title":"Construction of new MDS codes from Gabidulin codes","author":"berger","year":"2009","journal-title":"Proc ACC"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-017-0354-4"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/8960485\/08851252.pdf?arnumber=8851252","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T13:46:25Z","timestamp":1651067185000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8851252\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1]]},"references-count":30,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2019.2944372","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"type":"print","value":"0090-6778"},{"type":"electronic","value":"1558-0857"}],"subject":[],"published":{"date-parts":[[2020,1]]}}}