Information theoretic converse proofs for some PICOD problems
Information theoretic converse proofs for some PICOD problems
复制标题
一些PICOD问题的信息论逆证明
DOI：
--
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
Daniela Tuninetti
中科院分区：
文献类型：
--
作者：
Tang Liu;Daniela Tuninetti
本文给出了几类柔顺指数编码（PICOD）问题的信息论匡威证明。PICOD是索引编码问题的一种变体，其中用户在能够成功解码不在其边信息集中的任何一条消息时都感到满意。PICOD过去的工作提供了一些可实现的方案的基础上线性码，其中一些是已知的最佳服务器被限制为只能使用线性码。本文证明了在某些情况下，线性码在信息论意义下确实是最优的，即，它们不能被非线性代码打败。它还显示了其他类PICOD问题的信息论最优性是开放的。
This paper provides information theoretic converse proofs for some classes of Pliable Index CODing (PICOD) problems. PICOD is a variant of the index coding problem in which a user is satisfied whenever it can successfully decode any one message that is not in its side information set. Past work on PICOD provided a number of achievable schemes based on linear codes, some of which are known to be optimal when the server is restricted to use linear codes only. This paper proves that for some of those cases linear codes are indeed optimal in an information theoretic sense, i.e., they cannot be beaten by non-linear codes. It also shows the information theoretic optimality for other classes of PICOD problems that were open.
当且仅当拓扑为弦二分时，TDMA 对于 TIM 的全单播 DoF 区域是最佳的
影响因子：
2.5
作者：
Yi, Xinping;Sun, Hua;Jafar, Syed Ali;Gesbert, David
通讯作者：
Gesbert, David