Index coding and network coding via rank minimization

Index codes reduce the number of bits broadcast by a wireless transmitter to a number of receivers with different demands and with side information. It is known that the problem of finding optimal linear index codes is NP-hard. We investigate the performance of different heuristics based on rank minimization and matrix completion methods for constructing linear index codes over the reals. As a summary of our results, the alternating projections method gives the best results in terms of minimizing the number of broadcast bits and convergence rate and leads to up to 13% savings in communication cost compared to graph coloring algorithms studied in the literature. Moreover, we describe how the proposed methods can be used to construct linear network codes for non-multicast networks.

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

[2]  April Rasala Lehman,et al.  Complexity classification of network information flow problems , 2004, SODA '04.

[3]  Tracey Ho,et al.  Network Coding: An Introduction , 2008 .

[4]  David Tse,et al.  Two-unicast is hard , 2014, 2014 IEEE International Symposium on Information Theory.

[5]  Raymond W. Yeung,et al.  Information Theory and Network Coding , 2008 .

[6]  Muriel Médard,et al.  Quasi-linear network coding , 2014, 2014 International Symposium on Network Coding (NetCod).

[7]  Peter Sanders,et al.  Polynomial time algorithms for multicast network code construction , 2005, IEEE Transactions on Information Theory.

[8]  Robert D. Kleinberg,et al.  Index coding via linear programming , 2010, ArXiv.

[9]  Emmanuel J. Candès,et al.  Exact Matrix Completion via Convex Optimization , 2008, Found. Comput. Math..

[10]  Urs Niesen,et al.  Fundamental limits of caching , 2012, 2013 IEEE International Symposium on Information Theory.

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

[12]  L. Bregman.  The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming , 1967 .

[13]  Stephen P. Boyd,et al.  Alternating Projections , .

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

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

[16]  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).

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

[18]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[19]  Babak Hassibi,et al.  A matrix completion approach to linear index coding problem , 2014, 2014 IEEE Information Theory Workshop (ITW 2014).

[20]  Uri Stav,et al.  Non-Linear Index Coding Outperforming the Linear Optimum , 2007, FOCS.

[21]  Fang Zhao,et al.  Minimum-cost multicast over coded packet networks , 2005, IEEE Transactions on Information Theory.

[22]  M. Medard,et al.  "Real" and "Complex" Network Codes: Promises and Challenges , 2008, 2008 Fourth Workshop on Network Coding, Theory and Applications.

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

[24]  Michael Langberg,et al.  An Equivalence Between Network Coding and Index Coding , 2012, IEEE Transactions on Information Theory.

[25]  Urs Niesen,et al.  Decentralized coded caching attains order-optimal memory-rate tradeoff , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[26]  Prateek Jain,et al.  Low-rank matrix completion using alternating minimization , 2012, STOC '13.

[27]  Pablo A. Parrilo,et al.  Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization , 2007, SIAM Rev..

[28]  Laurent El Ghaoui,et al.  Advances in linear matrix inequality methods in control: advances in design and control , 1999 .

[29]  Moritz Hardt,et al.  Understanding Alternating Minimization for Matrix Completion , 2013, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[30]  Aaron B. Wagner,et al.  General index coding with side information: Three decoder case , 2013, 2013 IEEE International Symposium on Information Theory.

[31]  C. Eckart,et al.  The approximation of one matrix by another of lower rank , 1936 .

[32]  Syed Ali Jafar.  Elements of Cellular Blind Interference Alignment - Aligned Frequency Reuse, Wireless Index Coding and Interference Diversity , 2012, ArXiv.

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

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

[35]  Michael Gastpar,et al.  Reduced-Dimension Linear Transform Coding of Correlated Signals in Networks , 2012, IEEE Transactions on Signal Processing.

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

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

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

[39]  Tracey Ho,et al.  A Random Linear Network Coding Approach to Multicast , 2006, IEEE Transactions on Information Theory.

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

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

[42]  Muriel Médard,et al.  An algebraic approach to network coding , 2003, TNET.

[43]  Stephen P. Boyd,et al.  A rank minimization heuristic with application to minimum order system approximation , 2001, Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148).

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

[45]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

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

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

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

[49]  Alexander Sprintson,et al.  On the Minimum Number of Transmissions in Single-Hop Wireless Coding Networks , 2007, 2007 IEEE Information Theory Workshop.

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

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

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

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

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

[55]  Stephen P. Boyd,et al.  Rank minimization and applications in system theory , 2004, Proceedings of the 2004 American Control Conference.

[56]  Aaron D. Wyner,et al.  The Zero Error Capacity of a Noisy Channel , 1993 .