{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T03:26:41Z","timestamp":1761708401484},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1109\/isit.2009.5205921","type":"proceedings-article","created":{"date-parts":[[2009,8,24]],"date-time":"2009-08-24T15:09:52Z","timestamp":1251126592000},"page":"1353-1357","source":"Crossref","is-referenced-by-count":8,"title":["Feasible alphabets for communicating the sum of sources over a network"],"prefix":"10.1109","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":"17","article-title":"complexity classification of network information flow problems","author":"rasala lehman","year":"2003","journal-title":"Proceedings of 41st Annual Allerton Conference on Communication Control and Computing"},{"key":"18","article-title":"linear versus nonlinear boolean functions in network flow","author":"riis","year":"2004","journal-title":"Proceedings of 38th Annual Conference on Information Sciences and Systems"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.907345"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.883634"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557101"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498447"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/18.2626"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2005.843543"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/BF02551407"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.920209"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.851744"},{"key":"5","article-title":"on coding for nonmulticast networks","author":"me?dard","year":"2003","journal-title":"Proceedings of 41st Annual Allerton Conference on Communication Control and Computing"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847712"},{"key":"9","article-title":"some results on communicating the sum of sources over a network","author":"kumar rai","year":"0","journal-title":"Accepted in NetCod 2009"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595267"}],"event":{"name":"2009 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2009,6,28]]},"location":"Seoul, South Korea","end":{"date-parts":[[2009,7,3]]}},"container-title":["2009 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5179947\/5205248\/05205921.pdf?arnumber=5205921","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,17]],"date-time":"2017-03-17T20:12:54Z","timestamp":1489781574000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5205921\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit.2009.5205921","relation":{},"subject":[],"published":{"date-parts":[[2009,6]]}}}