{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T05:03:10Z","timestamp":1745557390673},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1109\/isit.2010.5513430","type":"proceedings-article","created":{"date-parts":[[2010,8,19]],"date-time":"2010-08-19T19:57:25Z","timestamp":1282247845000},"page":"1858-1862","source":"Crossref","is-referenced-by-count":16,"title":["A necessary and sufficient condition for solvability of a 3s\/3t sum-network"],"prefix":"10.1109","author":[{"given":"Sagar","family":"Shenvi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bikash Kumar","family":"Dey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797527"},{"journal-title":"Network Coding for Computing Part I Cut-Set Bounds","year":"0","author":"appuswamy","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056022"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4594947"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.2626"},{"journal-title":"Sum-networks System of Polynomial Equations Reversibility Insufficiency of Linear Network Coding Unachievability of Coding Capacity","year":"0","author":"rai","key":"ref15"},{"key":"ref16","article-title":"Network codes as codes on graphs","author":"koetter","year":"2004","journal-title":"Proc CISS"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511754623"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2010.5501820"},{"journal-title":"On the Solvability of 3-Source 3-Terminal Sum-Networks","year":"0","author":"shenvi","key":"ref19"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595267"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205921"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2009.5191400"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503143"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205758"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205983"}],"event":{"name":"2010 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2010,6,13]]},"location":"Austin, TX, USA","end":{"date-parts":[[2010,6,18]]}},"container-title":["2010 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5508195\/5513230\/05513430.pdf?arnumber=5513430","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,18]],"date-time":"2017-03-18T20:10:37Z","timestamp":1489867837000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5513430\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit.2010.5513430","relation":{},"subject":[],"published":{"date-parts":[[2010,6]]}}}