{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T20:49:09Z","timestamp":1770842949017,"version":"3.50.1"},"reference-count":64,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"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,11,1]]},"DOI":"10.1109\/itw54588.2022.9965849","type":"proceedings-article","created":{"date-parts":[[2022,12,7]],"date-time":"2022-12-07T20:47:00Z","timestamp":1670446020000},"page":"25-30","source":"Crossref","is-referenced-by-count":7,"title":["Multi-Phase Recoding for Batched Network Coding"],"prefix":"10.1109","author":[{"given":"Hoover H. F.","family":"Yin","sequence":"first","affiliation":[{"name":"The Chinese University of Hong Kong,Department of Information Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehrdad","family":"Tahernia","sequence":"additional","affiliation":[{"name":"N-Hop Technologies Ltd."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/2218\/1\/012003"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.3390\/e22070790"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2014.6970863"},{"key":"ref32","article-title":"Linear-complexity overhead-optimized random linear network codes","author":"mahdaviani","year":"2013"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2012.6261896"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283956"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2326976"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2334315"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034050"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2017.2787726"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.001.21828"},{"key":"ref62","volume":"6","author":"shokrollahi","year":"2011","journal-title":"Raptor Codes"},{"key":"ref61","article-title":"Systems and processes for decoding chain reaction codes through inactivation","author":"shokrollahi","year":"2005","journal-title":"US patent 6 856 263"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3126634"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503153"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518102"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2009.5191397"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095111"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"ref20","first-page":"385","article-title":"On the effects of heterogeneous packet lengths on network coding","author":"taghouti","year":"2014","journal-title":"Proc Euro Wireless ’14"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2019.8885446"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TBC.2019.2892594"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2013.6638639"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/LCN44214.2019.8990879"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICCW.2015.7247260"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2012.6261904"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3126426"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518091"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611427"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2009.5425257"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2012.120511"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834338"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-79278-6"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2014.7028592"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517910"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849280"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2736879"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2757241"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2017.2713813"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2884408"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2989619"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3137209"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3175815"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2292613"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2017.2670178"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2020.3027875"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1002\/ett.2899"},{"key":"ref4","first-page":"368","article-title":"Low complexity optimal algebraic multicast codes","author":"jaggi","year":"2003","journal-title":"Proc ISIT ’03"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.phycom.2008.01.006"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777464"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864424"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261636"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2017.2765641"},{"key":"ref9","first-page":"40","article-title":"Practical network coding","volume":"41","author":"chou","year":"2003","journal-title":"Proc ALLERTON ’03"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2972110"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2019.2891842"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541719"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2015.2435792"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/2632951.2632965"},{"key":"ref41","article-title":"Loss-resilient protocols for communication networks","author":"yin","year":"2019","journal-title":"U S Patent 10 425 192"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174517"},{"key":"ref43","first-page":"1957","article-title":"On the minimum delay of block in-terleaver for batched network codes","author":"yin","year":"2019","journal-title":"Proc ISIT ’19"}],"event":{"name":"2022 IEEE Information Theory Workshop (ITW)","location":"Mumbai, India","start":{"date-parts":[[2022,11,1]]},"end":{"date-parts":[[2022,11,9]]}},"container-title":["2022 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9965754\/9965755\/09965849.pdf?arnumber=9965849","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,26]],"date-time":"2022-12-26T19:42:44Z","timestamp":1672083764000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9965849\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,1]]},"references-count":64,"URL":"https:\/\/doi.org\/10.1109\/itw54588.2022.9965849","relation":{},"subject":[],"published":{"date-parts":[[2022,11,1]]}}}