{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:00:14Z","timestamp":1773378014666,"version":"3.50.1"},"reference-count":33,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"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":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834471","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"760-765","source":"Crossref","is-referenced-by-count":1,"title":["Symmetries in Linear Programming for Information Inequalities"],"prefix":"10.1109","author":[{"given":"Emirhan","family":"G\u00fcrp\u0131nar","sequence":"first","affiliation":[{"name":"Université de Montpellier, CNRS,LIRMM,Montpellier,France"}]}],"member":"263","reference":[{"key":"ref33","article-title":"On Characterization of Entropy Function via Information Inequalities","author":"zhang","year":"1998","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/18.641561"},{"key":"ref31","article-title":"On the Symmetry Reduction of Information Inequalities","author":"zhang","year":"2017","journal-title":"IEEE Transactions on Communications"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.2307\/2371182"},{"key":"ref10","article-title":"On the Size of Shares for Secret Sharing Schemes","volume":"6","author":"capocelli","year":"1997"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261840"},{"key":"ref12","article-title":"Non-Shannon Information Inequalities in Four Random Variables","author":"dougherty","year":"2011"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3005706"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-018-0529-7"},{"key":"ref15","article-title":"GNU Linear Programming Kit","year":"0"},{"key":"ref16","article-title":"GNU Multiple Precision Arithmetic Library","year":"0"},{"key":"ref17","article-title":"How to Use Undiscovered Information Inequalities: Direct Applications of Copy Lemma","author":"g\u00fcrp?nar","year":"2019","journal-title":"IEEE ISIT"},{"key":"ref18","article-title":"Gurobi Optimizer","year":"0"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1002\/ecjc.4430720906"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2012.10.020"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF00196772"},{"key":"ref27","article-title":"Lecture Notes in Secret Sharing","author":"padr\u00f3","year":"2013"},{"key":"ref3","article-title":"Common Information, Matroid Representation and Secret Sharing for Matroid Ports","author":"bamiloshin","year":"2020","journal-title":"Designs Codes and Cryptography"},{"key":"ref6","article-title":"Information Theory: Coding Theorems for Discrete Memoryless Systems","author":"csisz\u00e1r","year":"1982"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78524-8_12"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2352273"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s001459900029"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MARK.1979.8817296"},{"key":"ref1","article-title":"Bounds on Conditional Probabilities with Applications in Multi-User Communication","volume":"34","author":"ahlswede","year":"1976","journal-title":"Probability Theory and Related Fields"},{"key":"ref9","article-title":"Exploring the Entropic Region","author":"csirmaz","year":"2021"},{"key":"ref20","article-title":"Equivalence of Two Proof Techniques for Non-Shannon-type Inequalities","year":"2013","journal-title":"Tarik Kaced ISIT"},{"key":"ref22","article-title":"Infinitely Many Information Inequalities","author":"mat\u00fa\u0161","year":"2007","journal-title":"ISIT"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2006.11.013"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1515\/jmc.2010.004"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2011.01.003"},{"key":"ref26","article-title":"QSopt_ex","author":"applegate","year":"0"},{"key":"ref25","article-title":"Matroid Theory","author":"oxley","year":"1992"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834471.pdf?arnumber=9834471","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:55Z","timestamp":1773347755000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834471\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834471","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}