A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
A Deterministic Algorithm for Pliable Index Coding
[article]
2016
arXiv
pre-print
Pliable index coding considers a server with m messages, and n clients where each 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 O(\log^2(n)) transmissions and needs at least \Omega(log(n)) transmissions in the worst case, but finding a code of optimal length is NP-hard. In this paper,
arXiv:1601.05516v1
fatcat:6prh376sonhjnm4omlmmdaac34