A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Pliable index coding
2012
2012 IEEE International Symposium on Information Theory Proceedings
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;
doi:10.1109/isit.2012.6283912
dblp:conf/isit/BrahmaF12
fatcat:4jjgo5as6vfshezpeyzztiph44