| Title | Optimal Linear Coding Schemes for the Secure Decentralized Pliable Index Coding Problem |
| Publication Type | Conference Paper |
| Year of Publication | 2021 |
| Authors | Liu, Tang, Tuninetti, Daniela |
| Conference Name | 2020 IEEE Information Theory Workshop (ITW) |
| Keywords | Additives, coding theory, Conferences, encoding, Indexes, linear codes, Metrics, pubcrawl, resilience, Resiliency, security, Transmitters |
| Abstract | This paper studies the secure decentralized Pliable Index CODing (PICOD) problem, where the security constraint forbids users to decode more than one message while the decentralized setting imposes that there is no central transmitter in the system, and thus transmissions occur only among users. A converse bound from the Authors' previous work showed a factor of three difference in optimal code-length between the centralized and the decentralized versions of the problem, under the constraint of linear encoding. This paper first lists all linearly infeasible cases, that is, problems where no linear code can simultaneously achieve both correctness/decodability and security. Then, it proposes linear coding schemes for the remaining cases and shows that their code-length is to within an additive constant gap from the converse bound. |
| DOI | 10.1109/ITW46852.2021.9457649 |
| Citation Key | liu_optimal_2021 |
Optimal Linear Coding Schemes for the Secure Decentralized Pliable Index Coding Problem