Order Optimal Coded Delivery and Caching: Multiple Groupcast Index Coding
The capacity of caching networks has received considerable attention in the past few years. A particularly studied setting is the case of a single server (e.g., a base station) and multiple users, each of which caches segments of files in a finite library. Each user requests one (whole) file in the library and the server sends a common coded multicast message to satisfy all users at once. The problem consists of finding the smallest possible codeword length to satisfy such requests.
Provided by: University of Southampton Topic: Storage Date Added: Feb 2014 Format: PDF