Structural Properties of Index Coding Capacity

The index coding capacity is investigated through its structural properties. First, the capacity is characterized in three new multiletter expressions involving the clique number, Shannon capacity, and Lov\'asz theta function of the confusion graph, the latter notion introduced by Alon, Hassidim, Lubetzky, Stav, and Weinstein. The main idea is that every confusion graph can be decomposed into a small number of perfect graphs. The clique-number characterization is then utilized to show that the capacity is multiplicative under the lexicographic product of side information graphs, establishing the converse to an earlier result by Blasiak, Kleinberg, and Lubetzky. Second, sufficient and necessary conditions on the criticality of an index coding instance, namely, whether side information can be removed without reducing the capacity, are established based on the notion of unicycle, providing a partial answer to the question first raised by Tahmasbi, Shahrasbi, and Gohari. The necessary condition, along with other existing conditions, can be used to eliminate noncritical instances that do not need to be investigated. As an application of the established multiplicativity and criticality, only 10,634 (0.69%) out of 1,540,944 nonisomorphic six-message index coding instances are identified for further investigation, among which the capacity is still unknown for 119 instances.

[1]  Young-Han Kim,et al.  Index coding via random coding , 2014, 2014 Iran Workshop on Communication and Information Theory (IWCIT).

[2]  N. J. A. Sloane,et al.  The On-Line Encyclopedia of Integer Sequences , 2003, Electron. J. Comb..

[3]  Claude E. Shannon,et al.  The zero error capacity of a noisy channel , 1956, IRE Trans. Inf. Theory.

[4]  W. Imrich,et al.  Handbook of Product Graphs, Second Edition , 2011 .

[5]  Alexandros G. Dimakis,et al.  Graph theory versus minimum rank for index coding , 2014, 2014 IEEE International Symposium on Information Theory.

[6]  Alexandros G. Dimakis,et al.  On approximating the sum-rate for multiple-unicasts , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[7]  Alexandros G. Dimakis,et al.  Bipartite index coding , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[8]  Young-Han Kim,et al.  Local time sharing for index coding , 2014, 2014 IEEE International Symposium on Information Theory.

[9]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[10]  Yitzhak Birk,et al.  Informed-source coding-on-demand (ISCOD) over broadcast channels , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[11]  Zhen Zhang,et al.  Distributed Source Coding for Satellite Communications , 1999, IEEE Trans. Inf. Theory.

[12]  Lawrence Ong,et al.  The multi-sender multicast index coding , 2013, 2013 IEEE International Symposium on Information Theory.

[13]  M. Celebiler,et al.  On increasing the down-link capacity of a regenerative satellite repeater in point-to-point communications , 1978, Proceedings of the IEEE.

[14]  Syed Ali Jafar,et al.  Index Coding - An Interference Alignment Perspective , 2014, IEEE Trans. Inf. Theory.

[15]  Alexander Sprintson,et al.  On the relation between the Index Coding and the Network Coding problems , 2008, 2008 IEEE International Symposium on Information Theory.

[16]  Robert D. Kleinberg,et al.  Lexicographic Products and the Power of Non-linear Network Coding , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[17]  Michael Langberg,et al.  An Equivalence Between Network Coding and Index Coding , 2015, IEEE Trans. Inf. Theory.

[18]  P. Seymour,et al.  The Strong Perfect Graph Theorem , 2002, math/0212070.

[19]  Noga Alon,et al.  Broadcasting with Side Information , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[20]  Søren Riis,et al.  Information flows, graphs and their guessing numbers , 2006, 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks.

[21]  Urs Niesen,et al.  Fundamental Limits of Caching , 2014, IEEE Trans. Inf. Theory.

[22]  László Lovász,et al.  Normal hypergraphs and the perfect graph conjecture , 1972, Discret. Math..

[23]  Amin Gohari,et al.  Critical graphs in index coding , 2013, 2014 IEEE International Symposium on Information Theory.

[24]  Robert D. Kleinberg,et al.  Broadcasting With Side Information: Bounding and Approximating the Broadcast Rate , 2013, IEEE Transactions on Information Theory.

[25]  Alexandros G. Dimakis,et al.  Local graph coloring and index coding , 2013, 2013 IEEE International Symposium on Information Theory.

[26]  Randall Dougherty,et al.  Network Coding and Matroid Theory , 2011, Proceedings of the IEEE.

[27]  O. Ore.  Theory of Graphs , 1962 .

[28]  Lele Wang,et al.  On the capacity region for index coding , 2013, 2013 IEEE International Symposium on Information Theory.

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

[30]  Zhen Zhang,et al.  Dynamic index coding for wireless broadcast networks , 2012, INFOCOM.

[31]  Søren Riis.  Information flows, graphs and their guessing , 2006 .

[32]  Ziv Bar-Yossef,et al.  Index Coding With Side Information , 2011, IEEE Trans. Inf. Theory.

[33]  Raymond W. Yeung,et al.  Multilevel diversity coding with distortion , 1995, IEEE Trans. Inf. Theory.

[34]  Arya Mazumdar.  On a duality between recoverable distributed storage and index coding , 2014, 2014 IEEE International Symposium on Information Theory.

[35]  Maximilien Gadouleau,et al.  Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications , 2011, IEEE Transactions on Information Theory.

[36]  Alexandros G. Dimakis,et al.  Bounding multiple unicasts through index coding and Locally Repairable Codes , 2014, 2014 IEEE International Symposium on Information Theory.

[37]  Syed Ali Jafar,et al.  Topological Interference Management Through Index Coding , 2013, IEEE Transactions on Information Theory.

[38]  László Lovász,et al.  On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.

[39]  David Gesbert,et al.  Fractional Coloring (Orthogonal Access) achieves All-unicast Capacity (DoF) Region of Index Coding (TIM) if and only if Network Topology is Chordal , 2015, ArXiv.

[40]  Young-Han Kim,et al.  Structural properties of index coding capacity using fractional graph theory , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[41]  E. Scheinerman,et al.  Fractional Graph Theory: A Rational Approach to the Theory of Graphs , 1997 .

[42]  Aaron D. Wyner,et al.  Communicating via a processing broadcast satellite , 2002, IEEE Trans. Inf. Theory.

[43]  Young-Han Kim,et al.  Three stories on a two-sided coin: Index coding, locally recoverable distributed storage, and guessing games on graphs , 2015, 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[44]  W. Kern,et al.  Linear Programming Duality: An Introduction to Oriented Matroids , 1992 .

[45]  Xiao Huang,et al.  Index coding and network coding via rank minimization , 2015, 2015 IEEE Information Theory Workshop - Fall (ITW).

[46]  László Lovász,et al.  Normal hypergraphs and the perfect graph conjecture , 1972, Discret. Math..

[47]  Yitzhak Birk,et al.  Coding on demand by an informed source (ISCOD) for efficient broadcast of different supplemental data to caching clients , 2006, IEEE Transactions on Information Theory.

[48]  Aaron B. Wagner,et al.  A rate-distortion approach to index coding , 2014, ITA.

[49]  Giuseppe Caire,et al.  Fundamental Limits of Caching in Wireless D2D Networks , 2014, IEEE Transactions on Information Theory.

[50]  Syed Ali Jafar,et al.  Index coding: An interference alignment perspective , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.