{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:50:20Z","timestamp":1774680620626,"version":"3.50.1"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2011,10,1]],"date-time":"2011-10-01T00:00:00Z","timestamp":1317427200000},"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":[[2011,10]]},"DOI":"10.1109\/tit.2011.2155618","type":"journal-article","created":{"date-parts":[[2011,7,11]],"date-time":"2011-07-11T16:11:11Z","timestamp":1310400671000},"page":"6703-6717","source":"Crossref","is-referenced-by-count":41,"title":["Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications"],"prefix":"10.1109","volume":"57","author":[{"given":"Maximilien","family":"Gadouleau","sequence":"first","affiliation":[]},{"given":"S\u00f8ren","family":"Riis","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.834751"},{"key":"ref32","author":"babai","year":"1994","journal-title":"Handbook of Combinatorics"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057714"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/18.887851"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.883634"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.37236\/962","article-title":"Information flows, graphs and their guessing numbers","volume":"14","author":"riis","year":"2007","journal-title":"Electron J Combin"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2008.09.009"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.641561"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.681320"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.896862"},{"key":"ref16","author":"sun","year":"2009","journal-title":"Network Coding and Graph Entropy"},{"key":"ref17","first-page":"411","article-title":"Coding of an information source having ambiguous alphabet and the entropy of graphs","author":"krner","year":"1971","journal-title":"Proc 6th Prague Conf Information Theory Statistical Decision Function Random Processes"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1090\/dimacs\/020\/08","volume":"20","author":"simonyi","year":"1995","journal-title":"Combinatorial Optimization"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048502"},{"key":"ref28","author":"macwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.851744"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(85)90073-1"},{"key":"ref3","article-title":"Linear versus non-linear boolean functions in network flow","author":"riis","year":"2004","journal-title":"CISS"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/18.59932"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"ref8","author":"riis","year":"2007","journal-title":"Graph Entropy Network Coding and Guessing Games"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874405"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"ref9","first-page":"866","article-title":"Utilising public information in network coding","author":"riis","year":"2006","journal-title":"General Theory of Information Transfer and Combinatorics"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/11889342_56"},{"key":"ref22","first-page":"1","article-title":"A systematic approach to network coding problems using conflict graphs","author":"sundararajan","year":"2006","journal-title":"Proc Information Theory Applications Workshop"},{"key":"ref21","article-title":"Scheduling algorithms for providing flexible, rate-based, quality of service guarantees for packet-switching in Banyan networks","author":"caramanis","year":"2004","journal-title":"CISS"},{"key":"ref24","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0163-9","volume":"207","author":"godsil","year":"2001","journal-title":"Algebraic Graph Theory"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2008.ECP.96"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(75)90058-8"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(00)00298-3"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6034704\/05942165.pdf?arnumber=5942165","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:54:03Z","timestamp":1642006443000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5942165\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10]]},"references-count":33,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tit.2011.2155618","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10]]}}}