Fundamental Limits of Caching: Improved Bounds For Small Buffer Users

Abstract

In this work, the peak rate of the caching problem is investigated, under the scenario that the users are with small buffer sizes and the number of users is no less than the amount of files in the server. A novel coded caching strategy is proposed for such a scenario, leading to a lower peak rate compared to recent results in the literature. Furthermore, it is verified that our peak rates coincides with the cut-set bound analytically in an information-theoretic view.

12 pages

References in corpus (1)

• Fundamental Limits of Distributed Caching in D2D Wireless Networks

Cited by in corpus (16)

• Symmetry, Outer Bounds, and Code Constructions: A Computer-Aided Investigation on the Fundamental Limits of Caching
• A New Converse Bound for Coded Caching
• Caching and Delivery via Interference Elimination
• On the Optimality of Uncoded Cache Placement
• Characterizing the Rate-Memory Tradeoff in Cache Networks within a Factor of 2
• Coded Caching and Content Delivery with Heterogeneous Distortion Requirements
• On Multi-Server Coded Caching in the Low Memory Regime
• Wireless Coded Caching: A Topological Perspective
• The Optimal Placement Delivery Arrays
• Centralized Coded Caching for Heterogeneous Lossy Requests
• Feedback-Aided Coded Caching for the MISO BC with Small Caches
• $K$ Users Caching Two Files: An Improved Achievable Rate
• Efficient Scheduling and Power Allocation for D2D-assisted Wireless Caching Networks
• Cache Aided Communications with Multiple Antennas at Finite SNR
• Centralized Caching and Delivery of Correlated Contents over a Gaussian Broadcast Channel
• Throughput Analysis of Decentralized Coded Content Caching in Cellular Networks