ITW 2019, IEEE Information Theory Workshop, 25-28 August, 2019, Visby, Gotland, Sweden
The work considers the K-user cache-aided shared-link broadcast channel where each user has access to exactly z caches of normalized size, and where each cache assists exactly
z users. For this setting, for two opposing memory regimes, we propose novel caching and coded delivery schemes which maximize the local caching gain, and achieve a coding gain larger than 1+K (users served at a time) despite the fact that the total cache redundancy remains K irrespective of z. Interestingly, when z = K−1 K , the derived optimal coding gain is K z + 1, matching the performance of a hypothetical scenario where each user has its own dedicated cache of size z.
Systèmes de Communication
© 2019 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.