Optimal Index Codes With Near-Extreme Rates

The min-rank of a digraph was shown to represent the length of an optimal scalar linear solution of the corresponding instance of the Index Coding with Side Information (ICSI) problem. In this paper, the graphs and digraphs of near-extreme min-ranks are studied. Those graphs and digraphs correspond to the ICSI instances having near-extreme transmission rates when using optimal scalar linear index codes. In particular, it is shown that the decision problem whether a digraph has min-rank two is NP-complete. By contrast, the same question for graphs can be answered in polynomial time. In addition, a circuit-packing bound is revisited, and several families of digraphs, optimal with respect to this bound, whose min-ranks can be found in polynomial time, are presented.

[1]  Son Hoang Dau,et al.  Polynomial Time Algorithm for Min-Ranks of Graphs with Simple Tree Structures , 2013, Algorithmica.

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

[3]  Michael Langberg,et al.  Index coding with outerplanar side information , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[4]  Michael Langberg,et al.  On the complementary Index Coding problem , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[5]  Ishay Haviv,et al.  Linear Index Coding via Semidefinite Programming† , 2011, Combinatorics, Probability and Computing.

[6]  Michael Langberg,et al.  On linear index coding for random graphs , 2011, 2012 IEEE International Symposium on Information Theory Proceedings.

[7]  Robin Thomas,et al.  Packing directed circuits exactly , 2010, Comb..

[8]  Cheng Zhan,et al.  Broadcast Scheduling Based on Network Coding in Time Critical Wireless Networks , 2010, 2010 IEEE International Symposium on Network Coding (NetCod).

[9]  Muriel Médard,et al.  Joint Scheduling and Instantaneously Decodable Network Coding , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

[10]  Alexander Sprintson,et al.  On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory , 2008, IEEE Transactions on Information Theory.

[11]  Muriel Médard,et al.  Symbol-level network coding for wireless mesh networks , 2008, SIGCOMM '08.

[12]  Michael Langberg,et al.  On the Hardness of Approximating the Network Coding Capacity , 2008, IEEE Transactions on Information Theory.

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

[14]  Muriel Médard,et al.  XORs in the air: practical wireless network coding , 2008, TNET.

[15]  M.A.R. Chaudhry,et al.  Efficient algorithms for Index Coding , 2008, IEEE INFOCOM Workshops 2008.

[16]  Uri Stav,et al.  Non-Linear Index Coding Outperforming the Linear Optimum , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[17]  Kousha Etessami,et al.  On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract) , 2010, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[18]  Ziv Bar-Yossef,et al.  Index Coding With Side Information , 2006, IEEE Transactions on Information Theory.

[19]  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.

[20]  R. Koetter,et al.  An algebraic approach to network coding , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

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

[22]  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.

[23]  René Peeters,et al.  Orthogonal representations over finite fields and the chromatic number of graphs , 1996, Comb..

[24]  Vijaya Ramachandran,et al.  A Minimax Arc Theorem for Reducible Flow Graphs , 1990, SIAM J. Discret. Math..

[25]  Mary Lou Soffa,et al.  Feedback vertex sets and cyclically reducible graphs , 1985, JACM.

[26]  Maciej M. Syslo,et al.  A Labeling Algorithm to Recognize a Line Digraph and Output its Root Graph , 1982, Inf. Process. Lett..

[27]  C. Lucchesi,et al.  A Minimax Theorem for Directed Graphs , 1978 .

[28]  Robert E. Tarjan,et al.  Efficient Planarity Testing , 1974, JACM.

[29]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[30]  R. Z. Norman,et al.  Some properties of line digraphs , 1960 .

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

[32]  Paul D. Seymour,et al.  Packing circuits in eulerian digraphs , 1996, Comb..

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

[34]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.