{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T05:48:01Z","timestamp":1729662481504,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1109\/netcod.2013.6570838","type":"proceedings-article","created":{"date-parts":[[2013,8,14]],"date-time":"2013-08-14T15:40:54Z","timestamp":1376494854000},"page":"1-7","source":"Crossref","is-referenced-by-count":0,"title":["Strategic network coding — How much and where to code to obtain most of the benefits"],"prefix":"10.1109","author":[{"given":"Eric","family":"Gourdin","sequence":"first","affiliation":[]},{"given":"Yuhui","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Muriel","family":"Medard","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","article-title":"Some further investigation on maximum throughput: Does network coding really help ?","author":"gourdin","year":"2012","journal-title":"Proceedings of the 24th International Teletraffic Congress (ITC)"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2011.2161448"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2011516"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864435"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874434"},{"key":"13","article-title":"On minimizing network coding resources: An evolutionary approach","author":"kim","year":"2006","journal-title":"NetCod"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.231"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874523"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2011.5766116"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2003.1228459"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498443"},{"key":"7","first-page":"143","article-title":"A comparison of network coding and tree packing","author":"wu","year":"2004","journal-title":"Proceedings of 2004 International Symposium on Information Theory (ISIT)"},{"key":"6","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":"Information Theory IEEE Transactions on"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"9","first-page":"1232","article-title":"Network coding with a cost criterion","author":"lun","year":"2004","journal-title":"Proceedings of 2004 International Symposium on Information Theory and Its Applications (ISITA)"},{"key":"8","first-page":"2184","article-title":"On achieving optimal throughput with network coding","volume":"3","author":"li","year":"2005","journal-title":"INFOCOM 2005 24th Annual Joint Conference of the IEEE Computer and Communications Societies Proceedings IEEE"}],"event":{"name":"2013 International Symposium on Network Coding (NetCod)","start":{"date-parts":[[2013,6,7]]},"location":"Calgary, AB, Canada","end":{"date-parts":[[2013,6,9]]}},"container-title":["2013 International Symposium on Network Coding (NetCod)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6560497\/6570811\/06570838.pdf?arnumber=6570838","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T17:49:49Z","timestamp":1498067389000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6570838\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/netcod.2013.6570838","relation":{},"subject":[],"published":{"date-parts":[[2013,6]]}}}