Multi-access Coded Caching with Linear Subpacketization
share
We consider the multi-access coded caching problem, which contains a central server with N files, K caches with M units of memory each and K users where each one is connected to L (≥ 1) consecutive caches, with a cyclic wrap-around. Caches are populated with content related to the files and each user then requests a file that has to be served via a broadcast message from the central server with the help of the caches. We aim to design placement and delivery policies for this setup that minimize the central servers' transmission rate while satisfying an additional linear sub-packetization constraint. We propose policies that satisfy this constraint and derive upper bounds on the achieved server transmission rate, which upon comparison with the literature establish the improvement provided by our results. To derive our results, we map the multi-access coded caching problem to variants of the well-known index coding problem. In this process, we also derive new bounds on the optimal transmission size for a `structured' index coding problem, which might be of independent interest.
READ FULL TEXT