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.

翻译：索引编码和编码缓存是信息理论中两个相互密切关联的活跃研究课题。 受多存码编码缓存问题的驱动,我们研究了由数种对称比较方案结合形成的新型结构化索引编码问题。 我们从这一类比较方案的最佳服务器传输率中得出上下限,并表明它们最多相差两个系数。 最后,我们将这些结果应用于多存码编码缓存问题,以获得比最新技术更好的界限。