论文标题
索引编码中的信息泄漏
Information Leakage in Index Coding
论文作者
论文摘要
我们将信息泄漏研究到具有一般消息分布的索引编码中的猜测对手。在消失的误差和零解码假设下，我们在最佳泄漏率上产生了下限和上限，这些泄漏率是基于对手试图猜测的一组消息引起的子问题的广播率。当消息独立且均匀分布时，下限和上限匹配，建立了两个速率之间的等效性。
We study the information leakage to a guessing adversary in index coding with a general message distribution. Under both vanishing-error and zero-error decoding assumptions, we develop lower and upper bounds on the optimal leakage rate, which are based on the broadcast rate of the subproblem induced by the set of messages the adversary tries to guess. When the messages are independent and uniformly distributed, the lower and upper bounds match, establishing an equivalence between the two rates.
