{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:52:07Z","timestamp":1725472327738},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1109\/glocomw.2016.7848824","type":"proceedings-article","created":{"date-parts":[[2017,2,9]],"date-time":"2017-02-09T16:41:58Z","timestamp":1486658518000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["A Random Graph Theoretic Framework for Analyzing Instantly Decodable Network Codes"],"prefix":"10.1109","author":[{"given":"Shahriar Etemadi","family":"Tajbakhsh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Parastoo","family":"Sadeghi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Justin","family":"Coon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2014.2321397"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2014.7037599"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/VTCSpring.2013.6692503"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283957"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620795"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/AusCTW.2014.6766433"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503135"},{"key":"ref17","first-page":"1888","article-title":"A randomized algorithm and performance bounds for coded cooeprative data exchange","author":"sprinston","year":"0"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISNETCOD.2011.5979066"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874540"},{"article-title":"On minimizing the average packet decoding delay in wireless network coded broadcast","year":"0","author":"yu","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2014.11.008"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2010.5683677"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.4544612"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100053056"},{"article-title":"Computers and intractability-a guide to the theory of np-completeness","year":"1979","author":"garey","key":"ref7"},{"article-title":"On randomized network coding","year":"0","author":"ho","key":"ref2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2012.6404743"}],"event":{"name":"2016 IEEE Globecom Workshops (GC Wkshps)","start":{"date-parts":[[2016,12,4]]},"location":"Washington, DC, USA","end":{"date-parts":[[2016,12,8]]}},"container-title":["2016 IEEE Globecom Workshops (GC Wkshps)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7840534\/7848793\/07848824.pdf?arnumber=7848824","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T17:44:39Z","timestamp":1488390279000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7848824\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/glocomw.2016.7848824","relation":{},"subject":[],"published":{"date-parts":[[2016,12]]}}}