Chapter 3: Fundamental Limits of Shared-Link Coded Caching

Learning Objectives

• Prove the Maddah-Ali–Niesen cut-set converse lower bound $R^*(M) \geq \max_s (s - sM/\lfloor N/s \rfloor)$
• State and explain the Yu-Maddah-Ali-Avestimehr (2018) exact converse under uncoded placement
• Quantify the multiplicative gap between MAN achievability and known converses
• Understand the worst-case demand structure and why all-distinct demands are the hardest
• State the correlated-files result of Wan-Tuninetti-Ji-Caire and its delivery scheme
• Distinguish between optimal under uncoded placement (solved) and optimal in general (open)