The Minimal Set of Ingleton Inequalities

The Ingleton inequalities are the inequality constraints known to be required of representable matroids. For a matroid of n elements, there are 16n Ingleton inequalities. In this paper, we show that many of these inequalities are redundant. We explicitly determine the unique minimal set of Ingleton inequalities, which number on the order of 6n/4- O(5n). In information theory, these inequalities are required of the entropy functions of certain random variables constructed from linear subspaces. As a result, these inequalities appear as constraints in linear programming outer bounds for the capacity region of multisource network coding where the codes are required to be linear. Ingleton inequalities have also played an instrumental role in demonstrating the insufficiency of linear codes for multisource network coding. The reduction that we obtain for Ingleton inequalities is sufficiently large to meaningfully reduce the complexity of these linear programming bounds.

[1]  James G. Oxley,et al.  Matroid theory , 1992 .

[2]  Zhen Zhang,et al.  On Characterization of Entropy Function via Information Inequalities , 1998, IEEE Trans. Inf. Theory.

[3]  Raymond W. Yeung,et al.  On a relation between information inequalities and group theory , 2002, IEEE Trans. Inf. Theory.

[4]  Terence Chan,et al.  Dualities between Entropy Functions and Network Codes , 2008 .

[5]  Zhen Zhang,et al.  The Capacity Region for Multi-source Multi-sink Network Coding , 2007, 2007 IEEE International Symposium on Information Theory.

[6]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[7]  Ning Cai,et al.  Network Coding Theory (Foundations and Trends(R) in Communications and Information Theory) , 2006 .

[8]  Alex J. Grant,et al.  Dualities Between Entropy Functions and Network Codes , 2008, IEEE Transactions on Information Theory.

[9]  Alex J. Grant,et al.  Existence of new inequalities for representable polymatroids , 2009, 2010 IEEE International Symposium on Information Theory.

[10]  F. Matús.  PROBABILISTIC CONDITIONAL INDEPENDENCE STRUCTURES AND MATROID THEORY: BACKGROUND1 , 1993 .

[11]  Lihua Song,et al.  Zero-error network coding for acyclic network , 2003, IEEE Trans. Inf. Theory.

[12]  Frantisek Matús,et al.  Infinitely Many Information Inequalities , 2007, 2007 IEEE International Symposium on Information Theory.

[13]  Ryan Kinser,et al.  New inequalities for subspace arrangements , 2009, J. Comb. Theory, Ser. A.

[14]  T. Ho,et al.  On Linear Network Coding , 2010 .

[15]  M. Lunelli,et al.  Representation of matroids , 2002, math/0202294.

[16]  Nikolai K. Vereshchagin,et al.  Inequalities for Shannon Entropy and Kolmogorov Complexity , 1997, J. Comput. Syst. Sci..

[17]  Randall Dougherty,et al.  Linear rank inequalities on five or more variables , 2009, ArXiv.

[18]  Frantisek Matús,et al.  Adhesivity of polymatroids , 2007, Discret. Math..

[19]  Raymond W. Yeung,et al.  A framework for linear information inequalities , 1997, IEEE Trans. Inf. Theory.

[20]  R. Yeung,et al.  Network coding theory , 2006 .

[21]  Alex J. Grant,et al.  On capacity regions of non-multicast networks , 2010, 2010 IEEE International Symposium on Information Theory.

[22]  Randall Dougherty,et al.  Insufficiency of linear coding in network information flow , 2005, IEEE Transactions on Information Theory.

[23]  Axthonv G. Oettinger,et al.  IEEE Transactions on Information Theory , 1998 .

[24]  Raymond W. Yeung,et al.  A First Course in Information Theory , 2002 .