Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Communications in Information and Systems

A class of non-Shannon-type information inequalities and their applications

Raymond W. Yeung, Zhen Zhang

Published Jan 1, 2001• 16 citations
Publisher
DOI
10.4310/cis.2001.v1.n1.a6

Related papers

Lower Bounds for Garbled Circuits from Shannon-Type Information Inequalities

Jake Januzelli, Mike Rosulek, Lawrence Roy

Lecture notes in computer science•Jan 1, 2025•3 citations

Secret Sharing and Non-Shannon Information Inequalities

Amos Beimel, Ilan Orlov

Lecture notes in computer science•Jan 1, 2009•17 citations

Some inequalities satisfied by the quantities of information of Fisher and Shannon

Aart Johannes Stam

Information and Control•Jun 1, 1959•719 citations

Weighted p-Rényi Entropy Power Inequality: Information Theory to Quantum Shannon Theory

Junseo Lee, Hyeonjun Yeo, Kabgyun Jeong

arXiv:2311.06484•International Journal of Theoretical Physics•Nov 25, 2023•1 citation

A new class of non-Shannon-type inequalities for entropies

Konstantin Makarychev, Yury Makarychev, Andrei Romashchenko +1 more

In this paper we prove a countable set of non-Shannon-type linear information inequalities for entropies of discrete random variables, i.e., information inequalities which cannot be reduced to the "basic" inequality I(X : Y |Z) ≥ 0. Our results generalize the inequalities of Z. Zhang and R. Yeung (1998) who found the first examples of non-Shannon-type information inequalities.

Communications in Information and Systems•Jan 1, 2002•129 citations

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

Emirhan Gürpınar, Andrei Romashchenko

We discuss linear programming techniques that help to deduce corollaries of non-classical inequalities for Shannon's entropy. We focus on direct applications of the copy lemma. These applications involve implicitly some (known or unknown) non-classical 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 use 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 Vámos matroid.

arXiv:1901.07476•IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2019•27 citations
We discuss linear programming techniques that help to deduce corollaries of non-classical inequalities for Shannon's entropy. We focus on direct applications of the copy lemma. These applications involve implicitly some (known or unknown) non-classical 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 use 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 Vámos matroid.