Prerequisites & Notation

Before You Begin

The Coded Caching book relies on a compact information-theoretic toolkit plus some basic combinatorics. If any item below feels unfamiliar, revisit the linked chapter before proceeding.

  • Shannon entropy H(X)\mathrm{H}(X) and mutual information I(X;Y)\mathrm{I}(X;Y) for discrete RVs(Review ch01)

    Self-check: Can you state the chain rule H(X,Y)=H(X)+H(YX)\mathrm{H}(X,Y) = \mathrm{H}(X) + \mathrm{H}(Y|X) and identify when equality in the joint-entropy bound holds?

  • Broadcast channel basics — single sender, multiple receivers(Review ch15)

    Self-check: Given a Gaussian BC with two receivers of different SNRs, can you sketch the capacity region?

  • Basic probability and expectations over discrete distributions

    Self-check: Can you compute E[X]\mathbb{E}[X] when XX is Zipf-distributed over {1,,N}\{1,\ldots,N\}?

  • Binomial coefficients and basic counting

    Self-check: Can you state that (Kt)=K!/(t!(Kt)!)\binom{K}{t} = K!/(t!(K-t)!) and sketch why t(Kt)=2K\sum_t \binom{K}{t} = 2^K?

  • Linear codes over F2\mathbb{F}_2 and the XOR operation

    Self-check: Given bits aa and bb, can you recover aa if you know aba \oplus b and bb?

  • Asymptotic notation Θ()\Theta(\cdot), O()O(\cdot), Ω()\Omega(\cdot)

    Self-check: Can you distinguish Θ(K)\Theta(K) from O(K2)O(K^2) in the context of scaling laws?

Notation for This Chapter

Symbols introduced in Chapter 1. The coded-caching vocabulary sticks around for the rest of the book, so it pays to internalize it now.

SymbolMeaningIntroduced
KKNumber of users sharing the bottleneck links01
NNNumber of files in the library {W1,,WN}\{W_1, \ldots, W_N\}s01
MMPer-user cache size, measured in file units (0MN0 \leq M \leq N)s01
M/NM/NMemory ratio — the x-axis of the memory-load tradeoff curves01
RRDelivery rate (file units per channel use of the shared link)s01
PnP_nRequest probability for file WnW_n (popularity distribution)s02
Zk\mathcal{Z}_{k}Cache content of user kk after the placement phases01
d\mathbf{d}Demand vector (d1,,dK)(d_1, \ldots, d_K) where dk[N]d_k \in [N]s01