{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:02:12Z","timestamp":1773378132934,"version":"3.50.1"},"reference-count":17,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"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":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834704","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"1951-1956","source":"Crossref","is-referenced-by-count":3,"title":["On State-Dependent Streaming Erasure Codes over the Three-Node Relay Network"],"prefix":"10.1109","author":[{"given":"Gustavo","family":"Kasper Facenda","sequence":"first","affiliation":[]},{"given":"Elad","family":"Domanovitz","sequence":"additional","affiliation":[]},{"given":"M","family":"Nikhil Krishnan","sequence":"additional","affiliation":[]},{"given":"Ashish","family":"Khisti","sequence":"additional","affiliation":[]},{"given":"Silas L.","family":"Fong","sequence":"additional","affiliation":[]},{"given":"Wai-Tian","family":"Tan","sequence":"additional","affiliation":[]},{"given":"John","family":"Apostolopoulos","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437570"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2894124"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989375"},{"key":"ref13","first-page":"1","article-title":"Low field-size, rate-optimal streaming codes for channels with burst and random erasures","author":"krishnan","year":"2020","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849846"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174225"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611490"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2010.5430143"},{"key":"ref4","first-page":"11","article-title":"On randomized network coding","volume":"41","author":"ho","year":"2003","journal-title":"Proceedings of the Annual Allerton Conference on Communication Control and Computing"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6567095"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2017.2710958"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284046"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8057027"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2618924"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284055"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.834844"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8635971"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834704.pdf?arnumber=9834704","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:28Z","timestamp":1773347788000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834704\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834704","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}