论文标题
结构化索引编码问题和多访问编码的缓存
Structured Index Coding Problem and Multi-access Coded Caching
论文作者
论文摘要
索引编码和编码缓存是信息理论中有牢固联系的两个主动研究主题。由多访问编码的缓存问题的动机，我们研究了一类新的结构化索引编码问题（ICP），这些问题是由几个对称ICP的联合形成的。我们在此类ICP的最佳服务器传输速率上得出了上限和下限，并证明它们最多差异为两个。最后，我们将这些结果应用于多访问编码的缓存问题，以得出比艺术的状态更好的界限。
Index coding and coded caching are two active research topics in information theory with strong ties to each other. Motivated by the multi-access coded caching problem, we study a new class of structured index coding problems (ICPs) which are formed by the union of several symmetric ICPs. We derive upper and lower bounds on the optimal server transmission rate for this class of ICPs and demonstrate that they differ by at most a factor of two. Finally, we apply these results to the multi-access coded caching problem to derive better bounds than the state of the art.
