Recent Progresses in Characterising Information Inequalities

• Main Author: Terence Chan
• Format: Article
• Language: English
• Published: MDPI AG 2011-01-01
• Series: Entropy
• Subjects: determinantal inequalities; Greene’s Theorem; Kolmogorov complexity; quasi-uniformity; Shannon entropies; subspace rank inequalities
• Online Access: http://www.mdpi.com/1099-4300/13/2/379/

In this paper, we present a revision on some of the recent progresses made in characterising and understanding information inequalities, which are the fundamental physical laws in communications and compression. We will begin with the introduction of a geometric framework for information inequalities, followed by the first non-Shannon inequality proved by Zhang et al. in 1998 [1]. The discovery of this non-Shannon inequality is a breakthrough in the area and has led to the subsequent discovery of many more non-Shannon inequalities. We will also review the close relations between information inequalities and other research areas such as Kolmogorov complexity, determinantal inequalities, and group-theoretic inequalities. These relations have led to non-traditional techniques in proving information inequalities and at the same time made impacts back onthose related areas by the introduction of information-theoretic tools.