A New Converse Bound for Coded Caching
arXiv:1601.05690
Abstract
An information-theoretic lower bound is developed for the caching system studied by Maddah-Ali and Niesen. By comparing the proposed lower bound with the decentralized coded caching scheme of Maddah-Ali and Niesen, the optimal memory--rate tradeoff is characterized to within a multiplicative gap of for the worst case, improving the previous analytical gap of . Furthermore, for the case when users' requests follow the uniform distribution, the multiplicative gap is tightened to , improving the previous analytical gap of . As an independent result of interest, for the single-user average case in which the user requests multiple files, it is proved that caching the most requested files is optimal.
arXiv comment6 pages, 2 figures, to be presented at ITA 2016
References in corpus (2)
Cited by in corpus (13)
- Structural Properties of Uncoded Placement Optimization for Coded Delivery
- Coded Caching Schemes with Low Rate and Subpacketizations
- Coded Caching with Heterogeneous Cache Sizes and Link Qualities: The Two-User Case
- Characterizing the Rate-Memory Tradeoff in Cache Networks within a Factor of 2
- On the Placement Delivery Array Design for Coded Caching Scheme in D2D Networks
- A Novel Centralized Strategy for Coded Caching with Non-uniform Demands
- Constructions of Coded Caching Schemes with Flexible Memory Size
- The Optimal Placement Delivery Arrays
- Uncoded Placement Optimization for Coded Delivery
- Linear Coded Caching Scheme for Centralized Networks
- Some new bounds of placement delivery arrays
- Cache-Aided Content Delivery over Erasure Broadcast Channels
- Cache Aided Communications with Multiple Antennas at Finite SNR