Pliable Index Coding

We propose a new formulation of the index coding problem, where instead of demanding a specific message, clients are “pliable” and are happy to receive any one message they do not have. We prove that with this relaxation, although some instances of this problem become simple, in general the problem remains NP-hard. However, we develop heuristic algorithms that in our (extensive) experimental evaluation required only a logarithmic (in the number of messages) number of broadcast transmissions; this is an exponential improvement over tradi- tional index coding requirements.


Published in:
2012 Ieee International Symposium On Information Theory Proceedings (Isit)
Presented at:
IEEE International Symposium on Information Theory (ISIT'12), Cambridge, MA, USA, July 2-6, 2012
Year:
2012
Publisher:
New York, Ieee
ISBN:
978-1-4673-2579-0
Laboratories:




 Record created 2012-07-12, last modified 2018-03-17

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)