{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:34:56Z","timestamp":1774679696996,"version":"3.50.1"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1109\/tit.2017.2779851","type":"journal-article","created":{"date-parts":[[2017,12,4]],"date-time":"2017-12-04T19:21:25Z","timestamp":1512415285000},"page":"5296-5311","source":"Crossref","is-referenced-by-count":9,"title":["Streaming Codes for Multiplicative-Matrix Channels With Burst Rank Loss"],"prefix":"10.1109","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1933-066X","authenticated-orcid":false,"given":"Rafid","family":"Mahmood","sequence":"first","affiliation":[]},{"given":"Ahmed","family":"Badr","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2331-8965","authenticated-orcid":false,"given":"Ashish","family":"Khisti","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2011.6189949"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/9780470544693"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2555949"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CWIT.2011.5872144"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref13","first-page":"40","article-title":"Practical network coding","author":"chou","year":"2003","journal-title":"Proc Allerton Conf Commun Control Comput"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2011.5743582"},{"key":"ref16","first-page":"1","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Problems Inf Transmiss"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/18.75248"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928291"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2346079"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/IWCMC.2014.6906364"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2445753"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022869025953"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620379"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2015.7417571"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(78)90015-8"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2618924"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/PV.2012.6229737"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CC.2017.7839759"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2171530"},{"key":"ref9","article-title":"Dynamic information and constraints in source and channel coding","author":"martinian","year":"2004"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.834844"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1971.1090719"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862100"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/WINC.2010.5507933"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926449"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2016.2639062"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513521"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8392475\/08141961.pdf?arnumber=8141961","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:23:09Z","timestamp":1642004589000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8141961\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7]]},"references-count":31,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tit.2017.2779851","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7]]}}}