G. R. Blakley, Safeguarding cryptographic keys, AFIPS Conference Proceedings, vol.48, pp.313-317, 1979.

A. Shamir, How to share a secret, Commun. of the ACM, vol.22, pp.612-613, 1979.

P. D. Seymour, On secret-sharing matroids, J. of Combinatorial Theory, Series B, vol.56, pp.69-73, 1992.
DOI : 10.1016/0095-8956(92)90007-k
URL : https://doi.org/10.1016/0095-8956(92)90007-k

Z. Zhang and R. W. Yeung, On characterization of entropy function via information inequalities, IEEE Transactions on Information Theory, vol.44, issue.4, pp.1440-1452, 1998.

D. Hammer, A. Romashchenko, A. Shen, and N. Vereshchagin, Inequalities for Shannon entropy and Kolmogorov complexity, Journal of Computer and System Sciences, vol.60, issue.2, pp.442-464, 2000.
DOI : 10.1006/jcss.1999.1677
URL : https://doi.org/10.1006/jcss.1999.1677

K. Makarychev, Y. Makarychev, A. Romashchenko, and N. , Vereshchagin, A new class of non-Shannon-type inequalities for entropies. Communications in Information and Systems, vol.2, pp.147-166, 2002.

R. Ahlswede and J. Körner, On common information and related characteristics of correlated information sources, General Theory of Information Transfer and Combinatorics, pp.664-677, 2006.

A. Beimel and N. Livne, On matroids and non-ideal secret sharing, Proc. Theory of Cryptography Conference, pp.482-501, 2006.
DOI : 10.1007/11681878_25
URL : https://link.springer.com/content/pdf/10.1007%2F11681878_25.pdf

R. Dougherty, C. Freiling, and K. Zeger, Six new non-Shannon information inequalities, Proc. IEEE International Symposium on Information Theory, pp.233-236, 2006.
DOI : 10.1109/isit.2006.261840

D. G. Espinoza, On linear programming, integer programming and cutting planes, 2006.

F. Matú?, Infinitely many information inequalities, Proc. IEEE International Symposium on Information Theory, pp.41-44, 2007.

F. Matú?, Adhesivity of polymatroids, pp.2464-2477, 2007.

A. Beimel, N. Livne, and C. Padró, Matroids Can Be Far From Ideal Secret Sharing. Theory of Cryptography, pp.194-212, 2008.
DOI : 10.1007/978-3-540-78524-8_12

J. Martí-farré and C. Padró, On secret sharing schemes, matroids and polymatroids, J. Math. Cryptol, vol.4, pp.95-120, 2010.

A. Beimel, Secret-Sharing Schemes: A Survey, Proc. International Conference on Coding and Cryptology 2011, vol.6639, pp.11-46, 2011.
DOI : 10.1007/978-3-642-20901-7_2
URL : http://www.cs.bgu.ac.il/%7Ebeimel/Papers/Survey.pdf

J. R. Metcalf-burton, Improved upper bounds for the information rates of the secret sharing schemes induced by the Vámos matroid, Discrete Math, vol.311, pp.651-662, 2011.

R. Dougherty, C. Freiling, and K. Zeger, Non-Shannon information inequalities in four random variables, 2011.
DOI : 10.1109/isit.2006.261840

R. W. Yeung, A first course in information theory, 2012.
DOI : 10.1007/978-1-4419-8608-5

C. Padró, L. Vázquez, and A. Yang, Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming, vol.161, pp.1072-1084, 2013.

T. Kaced, Equivalence of two proof techniques for non-Shannon-type inequalities, Proc. IEEE International Symposium on Information Theory, pp.236-240, 2013.
DOI : 10.1109/isit.2013.6620223
URL : http://arxiv.org/abs/1302.2994

M. Gharahi, On the Complexity of Perfect Secret Sharing Schemes, Iran Univ. of Science and Technology, 2013.

L. Csirmaz, Book Inequalities. IEEE Trans. Information Theory, issue.11, pp.6811-6818, 2014.

F. Matú? and L. Csirmaz, Entropy region and convolution, IEEE Trans. Inf. Theory, issue.11, pp.6007-6018, 2016.

J. Apte and J. M. Walsh, Symmetry in network coding, Proc. IEEE International Symposium on Information Theory, pp.376-380, 2015.

Q. Chen and R. W. Yeung, Partition-symmetrical entropy functions, IEEE Transactions on Information Theory, issue.10, pp.5385-5402, 2016.

O. Farràs, T. Kaced, S. Martín, and C. Padró, Improving the linear programming technique in the search for lower bounds in secret sharing, Proc. Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp.597-621, 2018.

, The authors of the solver are David Applegate, William Cook, Sanjeeb Dash, and Daniel Espinoza. The code is distributed under GNU GPL v2.1. Website of the project

, The code is distributed under GNU GPL v3. Website of the project

, Gurobi Optimizer: a proprietary optimization solver for mathematical programming