{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T03:19:59Z","timestamp":1729653599628,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1109\/icc.2013.6655069","type":"proceedings-article","created":{"date-parts":[[2013,11,11]],"date-time":"2013-11-11T22:22:26Z","timestamp":1384208546000},"page":"3376-3381","source":"Crossref","is-referenced-by-count":0,"title":["On identifying which intermediate nodes should code in multicast networks"],"prefix":"10.1109","author":[{"given":"Tiago","family":"Pinto","sequence":"first","affiliation":[]},{"given":"Daniel E.","family":"Lucani","sequence":"additional","affiliation":[]},{"given":"Muriel","family":"Medard","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874523"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/637201.637237"},{"key":"11","article-title":"On achieving optimal throughput with network coding","author":"li","year":"2005","journal-title":"Proc INFOCOM'05"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2011.5766116"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"10","doi-asserted-by":"crossref","first-page":"2398","DOI":"10.1109\/TIT.2006.874430","article-title":"A unification of network coding and tree- packing (routing) theorems","volume":"52","author":"wu","year":"2006","journal-title":"IEEE Trans on Info Theory"},{"key":"7","article-title":"Network coding capacity with a constrained number of coding nodes","author":"cannons","year":"2006","journal-title":"Proc Allerton Conference on Communication Control and Computing"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2007.4454941"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523641"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"9","article-title":"A comparison of network coding and tree packing","author":"wu","year":"2004","journal-title":"Proc of ISIT'04"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2010.5502556"}],"event":{"name":"ICC 2013 - 2013 IEEE International Conference on Communications","start":{"date-parts":[[2013,6,9]]},"location":"Budapest, Hungary","end":{"date-parts":[[2013,6,13]]}},"container-title":["2013 IEEE International Conference on Communications (ICC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6637584\/6654691\/06655069.pdf?arnumber=6655069","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T01:46:20Z","timestamp":1498095980000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6655069\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/icc.2013.6655069","relation":{},"subject":[],"published":{"date-parts":[[2013,6]]}}}