{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:49:10Z","timestamp":1730274550372,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/isit.2011.6034052","type":"proceedings-article","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T13:24:20Z","timestamp":1317907460000},"page":"2652-2655","source":"Crossref","is-referenced-by-count":1,"title":["Linear coding for network computing"],"prefix":"10.1109","author":[{"given":"Rathinakumar","family":"Appuswamy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Massimo","family":"Franceschetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikhil","family":"Karamchandani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenneth","family":"Zeger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Comparing network coding with multicommodity flow for the k-pairs communication problem","volume":"964","author":"harvey","year":"2004","journal-title":"Tech Rep"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/TNET.2003.818197"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/CDC.2009.5400474"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/TIT.2002.807285"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1109\/TIT.2007.904785"},{"key":"ref15","article-title":"The tenet architecture for tiered sensor networks","author":"paek","year":"2009","journal-title":"ACM Transactions on Sensor Networks (TOSN)"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1109\/ITWKSPS.2010.5503143"},{"year":"2009","author":"rai","article-title":"Sum-networks: System of polynomial equations, unachievability of coding capacity, reversibility, insufficiency of linear network coding","key":"ref17"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1109\/ISIT.2008.4595267"},{"key":"ref19","first-page":"142","article-title":"Complexity classification of network information flow problems","author":"rasala lehman","year":"2003","journal-title":"Proceedings of the Fifteenth Annual ACM–SIAM Symposium on Discrete Algorithms"},{"year":"2011","author":"appuswamy","article-title":"Linear codes, target function classes, and network computing capacity","key":"ref4"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/TIT.2010.2095070"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/TIT.2005.851744"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/TIT.2005.864474"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/MCOM.2006.1632656"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/TIT.2008.920209"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/ISIT.2009.5205983"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1109\/18.850663"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1109\/TIT.2006.874531"}],"event":{"name":"2011 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2011,7,31]]},"location":"St. Petersburg, Russia","end":{"date-parts":[[2011,8,5]]}},"container-title":["2011 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6026198\/6033677\/06034052.pdf?arnumber=6034052","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,20]],"date-time":"2017-03-20T23:25:26Z","timestamp":1490052326000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6034052\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit.2011.6034052","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}