Fundamental Limits of Caching: Improved Bounds with Coded Prefetching

Abstract

We consider a cache network in which a single server is connected to multiple users via a shared error free link. The server has access to a database with $N$ files of equal length $F$, and serves $K$ users each with a cache memory of $MF$ bits. A novel centralized coded caching scheme is proposed for scenarios with more users than files $N\le K$ and cache capacities satisfying $\frac{1}{K}\le M\le \frac{N}{K}$. The proposed scheme outperforms the best rate-memory region known in the literature if $N\le K\le \frac{N^2+1}{2}$.

References in corpus (1)

• A Note on the Fundamental Limits of Coded Caching

Cited by in corpus (8)

• Symmetry, Outer Bounds, and Code Constructions: A Computer-Aided Investigation on the Fundamental Limits of Caching
• Coded Caching with Heterogeneous Cache Sizes and Link Qualities: The Two-User Case
• The Optimal Memory-Rate Trade-off for the Non-uniform Centralized Caching Problem with Two Files under Uncoded Placement
• Characterizing the Rate-Memory Tradeoff in Cache Networks within a Factor of 2
• Centralized Coded Caching of Correlated Contents
• Improved Converses and Gap Results for Coded Caching
• Efficient File Delivery for Coded Prefetching in Shared Cache Networks with Multiple Requests Per User
• On the Optimality of Ali-Niesen Decentralized Coded Caching Scheme With and Without Error Correction