{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T16:41:02Z","timestamp":1776444062371,"version":"3.51.2"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012,1]]},"DOI":"10.1109\/tit.2011.2169532","type":"journal-article","created":{"date-parts":[[2012,1,11]],"date-time":"2012-01-11T21:58:12Z","timestamp":1326319092000},"page":"50-63","source":"Crossref","is-referenced-by-count":71,"title":["On Network Coding for Sum-Networks"],"prefix":"10.1109","volume":"58","author":[{"given":"Brijesh Kumar","family":"Rai","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":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864474"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498447"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557101"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2005.843543"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/BF02551407"},{"key":"ref37","author":"ramamoorthy","year":"2008","journal-title":"Pers Commun"},{"key":"ref36","article-title":"On linear network coding","author":"jaggi","year":"2006","journal-title":"Proc 42st Ann Allerton Conf Commun Contr Comput"},{"key":"ref35","author":"atiyah","year":"1969","journal-title":"Introduction to Commutative Algebra"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874405"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.851744"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.920209"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.883634"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2008.ECP.96"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.907345"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056022"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4594947"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/18.2626"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595267"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205758"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/18.915643"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847712"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057272"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"ref6","article-title":"Complexity classification of network information flow problems","author":"lehman","year":"2003","journal-title":"Proc 41st Ann Allerton Conf Commun Contr Comput"},{"key":"ref29","article-title":"Functional source coding for networks with receiver side information","author":"feng","year":"2004","journal-title":"Proc Allerton Conf Commun Contr Comput"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"ref8","article-title":"On coding for nonmulticast networks","author":"mdard","year":"2003","journal-title":"Proc 41st Ann Allerton Conf Commun Contr Comput"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4594999"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"ref9","article-title":"Linear versus nonlinear boolean functions in network flow","author":"riis","year":"2004","journal-title":"Proc 38th Ann Conf Inf Sci Syst"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205983"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513422"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797527"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513430"},{"key":"ref23","author":"ramamoorthy","year":"2010","journal-title":"Communicating the Sum of Sources over a Network"},{"key":"ref26","author":"appuswamy","year":"0","journal-title":"Network Coding for Computing Part I Cut-Set Bounds"},{"key":"ref25","author":"shenvi","year":"0","journal-title":"On the Solvability of 3-Source 3-Terminal Sum-Networks"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6121971\/06121986.pdf?arnumber=6121986","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:47:19Z","timestamp":1633909639000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6121986\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1]]},"references-count":38,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2011.2169532","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1]]}}}