{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T19:53:16Z","timestamp":1729626796704,"version":"3.28.0"},"reference-count":22,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1109\/netcod.2014.6892127","type":"proceedings-article","created":{"date-parts":[[2014,9,10]],"date-time":"2014-09-10T11:46:12Z","timestamp":1410349572000},"page":"1-6","source":"Crossref","is-referenced-by-count":9,"title":["Network coding and the model theory of linear information inequalities"],"prefix":"10.1109","author":[{"given":"Arley","family":"Gomez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carolina","family":"Mejia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Andres","family":"Montoya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-008-9394-7"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511525919"},{"journal-title":"Complexity Real Computation","year":"1997","author":"blum","key":"17"},{"key":"18","doi-asserted-by":"crossref","first-page":"5625","DOI":"10.1109\/TIT.2012.2201340","article-title":"An implicit characterization of the achievable rate region for acyclic multisource multisink network coding","volume":"58","author":"yeung","year":"2012","journal-title":"IEEE Transactions of Information Theory"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2162183"},{"key":"16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8608-5","author":"yeung","year":"2002","journal-title":"A First Course in Information Theory"},{"journal-title":"Non-Shannon information inequalities in four random variables","year":"2011","author":"dougherty","key":"13"},{"key":"14","first-page":"2116","article-title":"A projection method for derivation of non-shannon-type information inequalities","author":"sun","year":"2008","journal-title":"Presented at the ISI T 2008"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.896862"},{"key":"12","first-page":"41","author":"mat\ufffds","year":"2007","journal-title":"Infinitely Ma Ny Information Inequalities"},{"journal-title":"Linear Network Coding and the Model Theory of Linear Rank Inequalities Positive Results","year":"2014","author":"g\ufffdmez","key":"21"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261840"},{"journal-title":"Entropy Region and Convolution","year":"2013","author":"csirmaz","key":"20"},{"key":"2","first-page":"3","article-title":"What are the laws of information theory","author":"pippenger","year":"1986","journal-title":"Presented at the Special Problems on Communication and Computation Conference"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.3390\/e10040765"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/18.681320"},{"journal-title":"Index Coding Capacity How Far Can One Go with only","year":"2013","author":"jafar","key":"7"},{"key":"6","first-page":"1","author":"baber","year":"2013","journal-title":"Multiple unicasts graph guessing games and nonshannon information inequalities"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/2220357.2220363"},{"key":"4","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1109\/TIT.2006.887090","article-title":"Two constructions on limits of entropy functions","volume":"53","author":"mat\ufffds","year":"2007","journal-title":"IEEE Transactions of Information Theory"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/s001459900029"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2013.013013.00104"}],"event":{"name":"2014 International Symposium on Network Coding (NetCod)","start":{"date-parts":[[2014,6,27]]},"location":"Aalborg Oest, Denmark","end":{"date-parts":[[2014,6,28]]}},"container-title":["2014 International Symposium on Network Coding (NetCod)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6880947\/6892118\/06892127.pdf?arnumber=6892127","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T16:12:58Z","timestamp":1498147978000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6892127\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/netcod.2014.6892127","relation":{},"subject":[],"published":{"date-parts":[[2014,6]]}}}