Structured Index Coding Problems and Multi-access Coded Caching

Autor:	Nikhil Karamchandani, Kota Srinivas Reddy
Rok vydání:	2021
Předmět:	Theoretical computer science Computer science Factor (programming language) Encoding (memory) Server State (computer science) Information theory computer Upper and lower bounds Class (biology) computer.programming_language Coding (social sciences)
Zdroj:	ITW
DOI:	10.1109/itw46852.2021.9457671
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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::16c6075e49872a98842c480075675406 https://doi.org/10.1109/itw46852.2021.9457671 Zobrazit plný text záznamu