{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:50:47Z","timestamp":1773377447721,"version":"3.50.1"},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"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":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849309","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"1377-1381","source":"Crossref","is-referenced-by-count":14,"title":["How to Use Undiscovered Information Inequalities: Direct Applications of the Copy Lemma"],"prefix":"10.1109","author":[{"given":"Emirhan","family":"G\u00fcrp\u0131nar","sequence":"first","affiliation":[{"name":"ENS de Lyon, France"}]},{"given":"Andrei","family":"Romashchenko","sequence":"additional","affiliation":[{"name":"LIRMM, University of Montpellier, CNRS, France"}]}],"member":"263","reference":[{"key":"ref10","article-title":"On linear programming, integer programming and cutting planes","author":"espinoza","year":"2006","journal-title":"PhD thesis"},{"key":"ref11","first-page":"41","article-title":"Infinitely many information inequalities","author":"mat\u00fa\u0161","year":"2007","journal-title":"Proc IEEE International Symposium on Information Theory"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2006.11.013"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78524-8_12"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1515\/jmc.2010.004"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20901-7_2"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2011.01.003"},{"key":"ref17","author":"dougherty","year":"2011","journal-title":"Non-Shannon information inequalities in four random variables"},{"key":"ref18","author":"yeung","year":"2012","journal-title":"A First Course in Information Theory"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2012.10.020"},{"key":"ref28","article-title":"GNU Linear Programming Kit","author":"makhorin","year":"0","journal-title":"The code is distributed under GNU GPL v3"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.681320"},{"key":"ref27","article-title":"QSopt_ex: an exact linear programming solver. The authors of the solver are David Applegate","author":"cook","year":"0","journal-title":"The code is distributed under GNU GPL v2 1"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(92)90007-K"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.4310\/CIS.2002.v2.n2.a3"},{"key":"ref29","year":"0","journal-title":"Gurobi Optimizer a proprietary optimization solver for mathematical programming"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1677"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_25"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/11889342_41"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261840"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MARK.1979.8817296"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620223"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2352273"},{"key":"ref21","article-title":"On the Complexity of Perfect Secret Sharing Schemes","author":"gharahi","year":"2013","journal-title":"Ph D Thesis (in Persian)"},{"key":"ref24","first-page":"376","article-title":"Symmetry in network coding. In Proc","author":"apte","year":"2015","journal-title":"IEEE International Symposium on Information Theory"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"6007","DOI":"10.1109\/TIT.2016.2601598","article-title":"Entropy region and convolution","volume":"62","author":"mat\u00fa\u0161","year":"2016","journal-title":"IEEE Trans Inf Theory"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78381-9_22"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2600580"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849309.pdf?arnumber=8849309","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:33:43Z","timestamp":1773347623000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849309\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849309","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}