Prerequisites

Before You Begin

This concluding chapter assumes the full book context. We revisit fundamental bounds and identify what remains unknown. Read after working through Chapters 2-21.

  • MAN and optimality under uncoded placement (Ch 2-3)(Review ch02)

    Self-check: Can you state Yu-Maddah-Ali-Avestimehr 2018 optimality?

  • Packetization (Ch 14)(Review ch14)

    Self-check: Why does (Kt)\binom{K}{t} subpacketization limit deployment?

  • D2D coded caching (Ch 10-11)(Review ch11)

    Self-check: What is the Θ(M/N)\Theta(M/N) scaling and its assumptions?

  • Cloud-RAN / NDT framework (Ch 8)(Review ch08)

    Self-check: What is the normalized delivery time?

  • All previous chapters are helpful context

    Self-check: What do you think is the most important open problem?

Notation for This Chapter

Symbols revisiting the full book's notation.

SymbolMeaningIntroduced
Runcoded∗R^*_\text{uncoded}Optimal rate under uncoded placement (MAN, YMA 2018)s01
Rcoded∗R^*_\text{coded}Optimal rate under coded placement (unknown)s01
{Mk}\{M_{k}\}Heterogeneous per-user cache sizess02
p\mathbf{p}General (non-uniform) demand popularity vectors02
FFFile size in bitss03
ε\varepsilonDecoding error probability (finite blocklength)s03
← Ch 21The Coded-Placement Gap