Network coding and the model theory of linear information inequalities

Let n ≥ 4, can the entropic region of order n be defined by a finite list of polynomial inequalities? This question was first asked by Chan and Grant. We show that if it were the case one could solve many algorithmic problems coming from Network Coding, Index Coding and Secret Sharing. Unfortunately, it seems that the entropic regions of order larger than four are not semialgebraic. Actually, we guess that it is the case and we provide strong evidence supporting our conjecture.

[1]  Randall Dougherty,et al.  Networks, Matroids, and Non-Shannon Information Inequalities , 2007, IEEE Transactions on Information Theory.

[2]  Hua Sun,et al.  Index Coding Capacity: How Far Can One Go With Only Shannon Inequalities? , 2013, IEEE Transactions on Information Theory.

[3]  László Csirmaz,et al.  Entropy Region and Convolution , 2016, IEEE Transactions on Information Theory.

[4]  Lenore Blum,et al.  Complexity and Real Computation , 1997, Springer New York.

[5]  J. Andrés Montoya,et al.  Linear network coding and the model theory of linear rank inequalities , 2014, 2014 International Symposium on Network Coding (NetCod).

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

[7]  Jean B. Lasserre,et al.  Moments and sums of squares for polynomial optimization and related problems , 2009, J. Glob. Optim..

[8]  Alex J. Grant,et al.  Non-linear Information Inequalities , 2008, Entropy.

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

[10]  Amos Beimel,et al.  Secret Sharing and Non-Shannon Information Inequalities , 2011, IEEE Transactions on Information Theory.

[11]  Weidong Xu,et al.  A projection method for derivation of non-Shannon-type information inequalities , 2008, 2008 IEEE International Symposium on Information Theory.

[12]  Rahim Tafazolli,et al.  Network Coding Theory: A Survey , 2013, IEEE Communications Surveys & Tutorials.

[13]  Georg Gottlob,et al.  Size and treewidth bounds for conjunctive queries , 2009, JACM.

[14]  Yunshu Liu.  Non-Shannon Information Inequalities in Four Random Variables , 2013 .

[15]  Demetres Christofides,et al.  Multiple unicasts, graph guessing games, and non-Shannon inequalities , 2013, 2013 International Symposium on Network Coding (NetCod).

[16]  Charles Steinhorn,et al.  Tame Topology and O-Minimal Structures , 2008 .

[17]  F. Mat.  Two Constructions on Limits of Entropy Functions , 2007, IEEE Trans. Inf. Theory.

[18]  Randall Dougherty,et al.  Six New Non-Shannon Information Inequalities , 2006, 2006 IEEE International Symposium on Information Theory.

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

[20]  László Csirmaz,et al.  The Size of a Share Must Be Large , 1994, Journal of Cryptology.

[21]  Zhen Zhang,et al.  An Implicit Characterization of the Achievable Rate Region for Acyclic Multisource Multisink Network Coding , 2012, IEEE Transactions on Information Theory.