论文标题
安全分散的柔韧索引编码问题的最佳线性编码方案
Optimal Linear Coding Schemes for the Secure Decentralized Pliable Index Coding Problem
论文作者
论文摘要
我们研究了用户的循环侧侧信息集，研究安全的分散型柔性索引编码（PICOD）问题。安全约束禁止每个用户解码多个消息，而分散的设置意味着系统中没有中央发射器。与问题的安全但集中式版本相比，我们以前的一项作品的相反，在线性编码的约束下，最佳代码长度的差异为三个差异。在本文中，我们首先列出了线性不可行的情况，即，没有线性代码可以同时实现正确性/解释性和安全性的问题。然后，我们建议所有剩余情况下的线性编码方案，并表明其所达到的代码长度是从我们的匡威界限内的加性常数差距内。
We study the secure decentralized Pliable Index CODing (PICOD) problem with circular side information sets at the users. The security constraint forbids every user to decode more than one message while a decentralized setting means there is no central transmitter in the system. Compared to the secure but centralized version of the problem, a converse bound from one of our previous works showed a factor of three difference in optimal code length under the constraint of linear encoding. In this paper, we first list the linearly infeasible cases, that is, problems where no linear code can simultaneously achieve both correctness/decodability and security. Then, we propose linear coding schemes for all remaining cases and show that their attained code length is to within an additive constant gap from our converse bound.
