Caching-aided multicast for partial information
Tetsunao Matsuta, Tomohiko Uyematsu · 2016
This paper deals with a multicast network with a server and many users. The server has content files with the same size, and each user requests one of the files. On the other hand, each user has a local memory, and a part of information of the files is cached (i.e., stored) in these memories in advance of users' requests. By using these cached information as side information, the server encodes files based on users' requests. Then, it sends a codeword through an error-free shared link for which all users can receive a common codeword from the server without error. We assume that the server transmits either of whole or partial information of requested files at each different transmission rate (i.e., the codeword length per file size). In this paper, we focus on the region of pairs of these two rates such that (whole or partial) information of requested files are recovered at each user with an arbitrary small error probability. We give inner and outer bounds on this region.