How to Use Undiscovered Information Inequalities: Direct Applications of the Copy Lemma

01/22/2019
by   Emirhan Gürpınar, et al.
0

We discuss linear programming techniques that help to deduce corollaries of non classic inequalities for Shannon's entropy. We focus on direct applications of the copy lemma. These applications involve implicitly some (known or unknown) non-classic universal inequalities for Shannon's entropy, though we do not derive these inequalities explicitly. To reduce the computational complexity of these problems, we extensively use symmetry considerations. We present two examples of usage of these techniques: we provide a reduced size formal inference of the best known bound for the Ingleton score (originally proven by Dougherty et al. with explicitly derived non Shannon type inequalities), and improve the lower bound for the optimal information ratio of the secret sharing scheme for an access structure based on the Vamos matroid.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/27/2022

Symmetries in Linear Programming for Information Inequalities

We study the properties of secret sharing schemes, where a random secret...
research
10/24/2018

Entropy in Quantum Information Theory -- Communication and Cryptography

In this Thesis, several results in quantum information theory are collec...
research
09/05/2016

Reflections on Shannon Information: In search of a natural information-entropy for images

It is not obvious how to extend Shannon's original information entropy t...
research
10/20/2020

Inequalities for space-bounded Kolmogorov complexity

There is a parallelism between Shannon information theory and algorithmi...
research
06/10/2020

Minimizing Deduction System and its Application

In a deduction system with some propositions and some known relations am...
research
02/19/2020

Common Information, Matroid Representation, and Secret Sharing for Matroid Ports

Linear information and rank inequalities as, for instance, Ingleton ineq...
research
10/29/2021

How to Find New Characteristic-Dependent Linear Rank Inequalities using Secret Sharing

Determining information ratios of access structures is an important prob...

Please sign up or login with your details

Forgot password? Click here to reset