Structured Index Coding Problem and Multi-Access Coded Caching
| Autor: | Kota Srinivas Reddy, Nikhil Karamchandani |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
FOS: Computer and information sciences
Theoretical computer science Computer science Computer Science - Information Theory Information Theory (cs.IT) Information theory Upper and lower bounds Class (biology) Computer Science - Distributed Parallel and Cluster Computing Index (publishing) Factor (programming language) FOS: Mathematics Mathematics - Combinatorics Distributed Parallel and Cluster Computing (cs.DC) Combinatorics (math.CO) State (computer science) Multi access computer computer.programming_language Coding (social sciences) |
| Zdroj: | IEEE Journal on Selected Areas in Information Theory. 2:1266-1281 |
| ISSN: | 2641-8770 |
| DOI: | 10.1109/jsait.2021.3126663 |
| Popis: | 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. Comment: 44 pages, single column, ITW and JSAIT |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|