{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T02:47:43Z","timestamp":1725763663342},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1109\/isit.2008.4595364","type":"proceedings-article","created":{"date-parts":[[2008,8,13]],"date-time":"2008-08-13T18:33:52Z","timestamp":1218652432000},"page":"2121-2125","source":"Crossref","is-referenced-by-count":6,"title":["The minimal set of Ingleton inequalities"],"prefix":"10.1109","author":[{"given":"Laurent","family":"Guille","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Terence H.","family":"Chan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Grant","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"3","DOI":"10.1109\/TIT.2005.851744"},{"doi-asserted-by":"publisher","key":"2","DOI":"10.1109\/TIT.2002.807285"},{"doi-asserted-by":"publisher","key":"10","DOI":"10.1016\/j.disc.2006.11.013"},{"doi-asserted-by":"publisher","key":"1","DOI":"10.1109\/18.850663"},{"doi-asserted-by":"publisher","key":"7","DOI":"10.1109\/ISIT.2007.4557201"},{"key":"6","article-title":"network coding theory","author":"yeung","year":"2006","journal-title":"SER"},{"key":"5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8608-5","author":"yeung","year":"2002","journal-title":"A First Course in Information Theory"},{"doi-asserted-by":"publisher","key":"4","DOI":"10.1109\/TIT.2003.820015"},{"doi-asserted-by":"publisher","key":"9","DOI":"10.1109\/18.641556"},{"doi-asserted-by":"publisher","key":"8","DOI":"10.1109\/NETCOD.2008.4476178"},{"year":"0","key":"11"},{"year":"2003","author":"schrijver","journal-title":"Combinatorial Optimization Polyhedra and Efficiency (Algorithms and Combinatorics)","key":"12"}],"event":{"name":"2008 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2008,7,6]]},"location":"Toronto, ON, Canada","end":{"date-parts":[[2008,7,11]]}},"container-title":["2008 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4586217\/4594928\/04595364.pdf?arnumber=4595364","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T06:55:39Z","timestamp":1497768939000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4595364\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/isit.2008.4595364","relation":{},"subject":[],"published":{"date-parts":[[2008,7]]}}}