A Polynomial-Time Algorithm for Pliable Index Coding
release_p2kavy7cgrb7hhqgmzhua54pna
by
Linqi Song, Christina Fragouli
2017
Abstract
In pliable index coding, we consider 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 broadcast transmissions, so that each client can
recover any one unknown message she does not already have. Previous work has
shown that the pliable index coding problem is NP-hard and requires at most
O(^2(n)) broadcast transmissions, which indicates exponential
savings over the conventional index coding that requires in the worst case
O(n) transmissions. In this work, building on a decoding criterion
that we propose, we first design a deterministic polynomial-time algorithm that
can realize the exponential benefits, by achieving, in the worst case, a
performance upper bounded by O(^2(n)) broadcast transmissions.
We extend our algorithm to the t-requests case, where each client requires
t unknown messages that she does not have, and show that our algorithm
requires at most O(t(n)+^2(n)) broadcast transmissions. We
construct lower bound instances that require at least Ω((n))
transmissions for linear pliable index coding and at least Ω(t+(n))
transmissions for the t-requests case, indicating that both our upper and
lower bounds are polynomials of (n) and differ within a factor of
O((n)). Finally, we provide a probabilistic analysis and show
that the required number of transmissions is almost surely Θ((n)),
as compared to Θ(n/(n)) for index coding. Our numerical experiments
show that our algorithm outperforms existing algorithms for pliable index
coding by up to 50% less transmissions.
In text/plain
format
Archived Files and Locations
application/pdf 834.1 kB
file_msyajaorqjf7xnswrqvwyybhs4
|
arxiv.org (repository) web.archive.org (webarchive) |
1610.06845v2
access all versions, variants, and formats of this works (eg, pre-prints)