Pliable Index Coding with Restricted Decoding Sets

Pliable index coding studies flexible communication networks where each receiver just needs to receive any message that it does not already have. In this work, we consider a more practical but restricted scenario where each receiver wants any message it does not have from a particular subset of messages. We first adapt coding schemes from pliable index coding to this new restricted pliable index coding setting. We show that the adapted scheme is optimal under certain conditions. We simplify the computational complexity when constructing coding schemes for restricted pliable index coding from exponential to linear. We also construct two new coding schemes for the restricted setting, which can outperform the adapted scheme.