Symmetries in Linear Programming for Information Inequalities - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2022

Symmetries in Linear Programming for Information Inequalities

Emirhan Gürpınar
  • Function : Author
  • PersonId : 1216314


We study the properties of secret sharing schemes, where a random secret value is transformed into shares distributed among several participants in such a way that only the qualified groups of participants can recover the secret value. We improve the lower bounds on the sizes of shares for several specific problems of secret sharing. To this end, we use the method of non-Shannon-type information inequalities going back to Z. Zhang and R.W. Yeung. We employ and extend the linear programming technique that allows to apply new information inequalities indirectly, without even writing them down explicitly. To reduce the complexity of the problems of linear programming involved in the bounds we extensively use symmetry considerations.
Fichier principal
Vignette du fichier
2201.11656.pdf (185.35 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

lirmm-03931504 , version 1 (17-10-2023)



Emirhan Gürpınar. Symmetries in Linear Programming for Information Inequalities. ISIT 2022 - IEEE International Symposium on Information Theory, Jun 2022, Espoo, Finland. pp.760-765, ⟨10.1109/ISIT50566.2022.9834471⟩. ⟨lirmm-03931504⟩
24 View
3 Download



Gmail Mastodon Facebook X LinkedIn More