Structured Index Coding Problem and Multi-access Coded Caching

Abstract

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.

arXiv comment44 pages, single column, ITW and JSAIT

References in corpus (8)

• The Exact Rate-Memory Tradeoff for Caching with Uncoded Prefetching
• On the Capacity Region for Index Coding
• The Single-Uniprior Index-Coding Problem: The Single-Sender Case and The Multi-Sender Extension
• Rate-Memory Trade-off for Multi-access Coded Caching with Uncoded Placement
• Storage Capacity of Repairable Networks
• Interlinked Cycles for Index Coding: Generalizing Cycles and Cliques
• An Improved Multi-access Coded Caching with Uncoded Placement
• Local Partial Clique Covers for Index Coding