{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T21:02:32Z","timestamp":1774990952504,"version":"3.50.1"},"reference-count":16,"publisher":"IEEE","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1109\/isit.2016.7541711","type":"proceedings-article","created":{"date-parts":[[2016,8,15]],"date-time":"2016-08-15T18:52:57Z","timestamp":1471287177000},"page":"2309-2313","source":"Crossref","is-referenced-by-count":5,"title":["Coding advantage in communications among peers"],"prefix":"10.1109","author":[{"given":"Kai","family":"Cai","sequence":"first","affiliation":[{"name":"The University of Hong Kong, China"}]},{"given":"Guangyue","family":"Han","sequence":"additional","affiliation":[{"name":"The University of Hong Kong, China"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874531"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874543"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283627"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394800"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282478"},{"key":"ref15","article-title":"Network Coding Theory (Foundations and Trends in Communications and Information Theory)","author":"yeung","year":"2006","journal-title":"Hanover MA USA"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1956-045-5"},{"key":"ref4","article-title":"Network coding in undirected networks","author":"li","year":"2004","journal-title":"Proc CISS"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2004.1405308"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173720"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2011435"},{"key":"ref8","article-title":"Comparing network coding with multicommodity flow for the k-pairs communication problems","author":"harvey","year":"2004","journal-title":"Comput Sci Artif Intell Lab Tech Rep"},{"key":"ref7","article-title":"Network coding: The case of multiple unicast sessions","author":"li","year":"0","journal-title":"Proc of Allerton Conf 2004"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777464"},{"key":"ref1","article-title":"Network coding gain of combination networks","author":"ngai","year":"2004","journal-title":"Proc ITW"},{"key":"ref9","article-title":"Combinatorial Optimization","author":"schrijver","year":"2003"}],"event":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","location":"Barcelona, Spain","start":{"date-parts":[[2016,7,10]]},"end":{"date-parts":[[2016,7,15]]}},"container-title":["2016 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7532279\/7541040\/07541711.pdf?arnumber=7541711","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:52:35Z","timestamp":1774986755000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7541711\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit.2016.7541711","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}