A Note on the Fundamental Limits of Coded Caching

TL;DR

This paper explores the theoretical limits of coded caching for a system with three files and three users, providing an improved outer bound using a computational approach to better understand the fundamental constraints.

Contribution

It introduces an enhanced outer bound for the coded caching problem with three files and users, utilizing a computational method previously developed by the author.

Findings

Derived a tighter outer bound for the three-file, three-user coded caching scenario.

Demonstrated the effectiveness of the computational approach in information theoretic limit analysis.

Contributed to the SCITL collection of solutions for computed information theoretic limits.

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)".