A Note on the Fundamental Limits of Coded Caching

Abstract

The fundamental limit of coded caching is investigated for the case with $N=3$ files and $K=3$ users. An improved outer bound is obtained through the computational approach developed by the author in an earlier work. This result is part of the online collection of "Solutions of Computed Information Theoretic Limits (SCITL)".

Cited by in corpus (8)

• Fundamental Limits of Caching: Improved Bounds with Coded Prefetching
• On the Optimality of Uncoded Cache Placement
• Improved Lower Bounds for Coded Caching
• Fundamental Limits of Coded Caching: The Memory Rate Pair (K-1-1/K, 1/(K-1))
• Improved Converses and Gap Results for Coded Caching
• $K$ Users Caching Two Files: An Improved Achievable Rate
• Some new bounds of placement delivery arrays
• Cache Aided Communications with Multiple Antennas at Finite SNR