Private Pliable Index Coding
share
The Pliable Index CODing (PICOD) problem is a variant of the index coding problem, where the desired messages by the users, who are equipped with message side information, is part of the optimization. This paper studies a special class of private PICOD where 1) the side information structure is circular, and 2) each user can decode only one message. The first condition is a special case of the `circular-arc network topology hypergraph' class of PICOD studied in [T. Liu and D. Tuninetti, `Tight information theoretic converse results for some pliable index coding problems,' arXiv:1810.02451, 2018], for which an optimal solution was given without the second constraint. The second condition was first studied in [S. Sasi and B. S. Rajan, "On pliable index coding,' arXiv:1901.05809, 2019] and was motivated by the need to keep content privacy is some distribution networks. An achievable scheme is proposed in this paper. This scheme not only strictly outperforms the one in [S. Sasi and B. S. Rajan, `On pliable index coding,' arXiv:1901.05809, 2019] for some values of the system parameters, but it is also information theoretically optimal in some settings. For the remaining cases, the proposed codes are shown to require at most one more transmission than the optimal linear codes.
READ FULL TEXT
