{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:05:20Z","timestamp":1750694720262,"version":"3.37.3"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2015,5,1]],"date-time":"2015-05-01T00:00:00Z","timestamp":1430438400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2015,5,1]],"date-time":"2015-05-01T00:00:00Z","timestamp":1430438400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2015,5,1]],"date-time":"2015-05-01T00:00:00Z","timestamp":1430438400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2015,5,1]],"date-time":"2015-05-01T00:00:00Z","timestamp":1430438400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"U.S. National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Institute for Defense Analyses"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1109\/tit.2015.2403361","type":"journal-article","created":{"date-parts":[[2015,2,13]],"date-time":"2015-02-13T19:59:16Z","timestamp":1423857556000},"page":"2510-2530","source":"Crossref","is-referenced-by-count":4,"title":["Characteristic-Dependent Linear Rank Inequalities With Applications to Network Coding"],"prefix":"10.1109","volume":"61","author":[{"given":"Randall","family":"Dougherty","sequence":"first","affiliation":[]},{"given":"Eric","family":"Freiling","sequence":"additional","affiliation":[]},{"given":"Kenneth","family":"Zeger","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"article-title":"Achievable rate regions for network coding","year":"2013","author":"dougherty","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1677"},{"key":"ref12","first-page":"149","article-title":"Representation of matroids","author":"ingleton","year":"1971","journal-title":"Proc Conf Combin Math and Its Appl"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"41","DOI":"10.4310\/CIS.2003.v3.n1.a3","article-title":"On the tightness of the Zhang–Yeung inequality for Gaussian vectors","volume":"3","author":"ln?ni?ka","year":"2003","journal-title":"Commun Inf Syst"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.4310\/CIS.2002.v2.n2.a3"},{"key":"ref15","first-page":"41","article-title":"Infinitely many information inequalities","author":"mat\u00fa\u0161","year":"2007","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2004.1405315"},{"journal-title":"Matroid Theory","year":"1992","author":"oxley","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref19","first-page":"2116","article-title":"A projection method for derivation of non-Shannon-type information inequalities","author":"xu","year":"2008","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557448"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864474"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.896862"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261840"},{"article-title":"Linear rank inequalities on five or more variables","year":"2012","author":"dougherty","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.851744"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.39"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.920209"},{"journal-title":"Information Theory and Network Coding","year":"2008","author":"yeung","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.4310\/CIS.2003.v3.n1.a4"},{"key":"ref21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8608-5","author":"yeung","year":"2002","journal-title":"A First Course in Information Theory"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/18.681320"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/18.641561"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/18\/7088688\/7042291-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7088688\/07042291.pdf?arnumber=7042291","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,29]],"date-time":"2022-04-29T17:36:38Z","timestamp":1651253798000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7042291\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5]]},"references-count":24,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.2015.2403361","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2015,5]]}}}