{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T06:59:55Z","timestamp":1648796395621},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2011,2,1]],"date-time":"2011-02-01T00:00:00Z","timestamp":1296518400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2011,2]]},"DOI":"10.1109\/tit.2010.2094890","type":"journal-article","created":{"date-parts":[[2011,1,21]],"date-time":"2011-01-21T20:15:42Z","timestamp":1295640942000},"page":"1080-1091","source":"Crossref","is-referenced-by-count":7,"title":["Minimum Cost Mirror Sites Using Network Coding: Replication versus Coding at the Source Nodes"],"prefix":"10.1109","volume":"57","author":[{"given":"Shurui","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aditya","family":"Ramamoorthy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Muriel","family":"Medard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00228-4"},{"key":"ref32","first-page":"41","article-title":"Infinitely many information inequalities","author":"mat","year":"2007","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847712"},{"key":"ref30","author":"kleinberg","year":"2006","journal-title":"Algorithm Design"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498511"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874523"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-006-0014-9"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2006.879847"},{"key":"ref14","first-page":"834","article-title":"the delay region for p2p file transfer","author":"wu","year":"2009","journal-title":"Proc IEEE Intl Symp Inf Theory"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205897"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5061966"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874534"},{"key":"ref18","author":"li","year":"2010","journal-title":"Theoretical Aspects of Distributed Computing in Sensor Networks"},{"key":"ref19","article-title":"Minimum-cost subgraphs for joint distributed source and network coding","author":"lee","year":"2007","journal-title":"Proc Workshop Network Coding Theory Appl"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ITWITWN.2007.4318051"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1209237"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523641"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1063786.1063788"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/HICSS.2004.1265480"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2003.814608"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258660"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-3664(00)00315-7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1015467.1015508"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832261"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/964723.383072"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557476"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1459359.1459396"},{"key":"ref21","author":"yeung","year":"2008","journal-title":"Information Theory and Network Coding"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062277"},{"key":"ref23","article-title":"How good is random linear coding based distributed networked storage","author":"acedaski","year":"2005","journal-title":"NetCod"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.232"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.262068"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5695090\/05695124.pdf?arnumber=5695124","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:47:34Z","timestamp":1633909654000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5695124\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2]]},"references-count":33,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2010.2094890","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2]]}}}