A polynomial-time algorithm for pliable index coding

Pliable index coding considers a server with m messages and n clients where each client has as side information a subset of the messages. We seek to minimize the number of transmissions the server should make, so that each client receives (any) one message she does not already have. Previous work has shown that the server can achieve this using at most O(log2(n)) transmissions and needs at least Ω(log(n)) transmissions in the worst case, but finding a code of optimal length is NP-hard. In this paper, we design a polynomial-time algorithm that uses less than O(log2(n)) transmissions, i.e., almost worst-case optimal. We also establish a connection between the pliable index coding problem and the minrank problem over a family of mixed matrices.

[1]  Christina Fragouli,et al.  A Polynomial-Time Algorithm for Pliable Index Coding , 2018, IEEE Transactions on Information Theory.

[2]  Omri Weinstein,et al.  The Minrank of Random Graphs , 2016, IEEE Transactions on Information Theory.

[3]  Christina Fragouli,et al.  A Deterministic Algorithm for Pliable Index Coding , 2016, ArXiv.

[4]  Christina Fragouli,et al.  Content-type coding , 2015, 2015 International Symposium on Network Coding (NetCod).

[5]  Christina Fragouli,et al.  Pliable Index Coding: The multiple requests case , 2013, 2013 IEEE International Symposium on Information Theory.

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

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

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

[9]  Yeow Meng Chee,et al.  Optimal index codes with near-extreme rates , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

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

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

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

[13]  Yeow Meng Chee,et al.  On the Security of Index Coding With Side Information , 2011, IEEE Transactions on Information Theory.

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

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

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

[17]  Uri Stav,et al.  Non-Linear Index Coding Outperforming the Linear Optimum , 2007, 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]  Guy Kortsarz,et al.  Logarithmic inapproximability of the radio broadcast problem , 2004, J. Algorithms.

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

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

[22]  Robin Wilson,et al.  Modern Graph Theory , 2013 .