Chapter 18: Multi-Access Coded Caching

Learning Objectives

• Define the multi-access coded caching model
• State the Hachem-Karamchandani-Diggavi (HKD 2017) cyclic wrap-around scheme
• Compute achievable multi-access rates as a function of $L$ (caches accessed per user)
• Understand the role of combinatorial / resolvable designs in multi-access placement
• Compare multi-access with D2D caching (Ch 11)
• Analyze tradeoffs: more caches per user vs simpler topology