Improved Converses and Gap Results for Coded Caching
- 18 July 2018
- journal article
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 64 (11) , 7051-7062
Abstract
Improved lower bounds are derived on the average and worst case rate-memory tradeoffs of the Maddah-Ali and Niesen-coded caching scenario. For any number of users and files and for arbitrary cache sizes, the multiplicative gap between the exact rate-memory tradeoff and the new lower bound is shown to be less than 2.315 in the worst case scenario and 2.507 in the average-case scenario.Keywords
All Related Versions
Funding Information
- Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung (158487)
This publication has 47 references indexed in Scilit:
- Cache aided wireless networks: Tradeoffs between storage and latency2016
- Hypergraph-Based Analysis of Clustered Co-Operative Beamforming With Application to Edge CachingIEEE Wireless Communications Letters, 2015
- Cellular Interference Alignment: Omni-Directional Antennas and Asymmetric ConfigurationsIEEE Transactions on Information Theory, 2015
- Distortion-memory tradeoffs in cache-aided wireless video delivery2015
- Coded caching for reducing CSIT-feedback in wireless communications2015
- Improved approximation of storage-rate tradeoff for caching via new outer bounds2015
- Cache-aided interference channels2015
- Online Coded CachingIEEE/ACM Transactions on Networking, 2015
- Hierarchical coded caching2014
- Fundamental Limits of CachingIEEE Transactions on Information Theory, 2014