The Pliable Index CODing (PICOD) problem is a variant of the Index Coding (IC) problem, where the desired messages by the users, who are equipped with message side information, are part of the optimization. This paper studies the PICOD problem where users are subject to a privacy constraint. In particular, the following special class of private PICODs is investigated: 1) the side information structure is circular, and 2) each user can decode one and only one message. The first condition is a special case of the “circular-arc network topology hypergraph” class of PICOD studied in [6], for which an optimal solution was given without the privacy constraint. The second condition was first studied in [9] and was motivated by the need to keep content private in some distribution networks. This paper proposes both converse and achievable bounds. The proposed achievable scheme not only strictly outperforms the existing one for some values of the system parameters, but it is also information theoretically optimal in some settings. For the remaining cases, the proposed linear code is shown to require at most one more transmission than the best possible linear code.
展开▼
