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

The fundamental limits of performance for a general model of information retrieval from databases are studied. In the scenarios considered a large quantity of information is to be stored on some physical storage device. Requests for information are modeled as a randomly generated sequence with a known distribution. The requests are assumed to be “context-dependent”, i.e., to vary according to t...