References & Further Reading

References

1. M. A. Maddah-Ali and U. Niesen, Fundamental Limits of Caching, 2014

   The foundational paper on coded caching. Introduces the MAN scheme and proves the memory-load tradeoff for the shared-link model. Essential reading.

2. M. A. Maddah-Ali and U. Niesen, Decentralized Coded Caching Attains Order-Optimal Memory-Rate Tradeoff, 2015

   Extends coded caching to decentralized placement (no coordination during caching phase). Shows that random independent caching achieves the same order-optimal tradeoff.

3. K. Wan, D. Tuninetti, and P. Piantanida, On the Optimality of Uncoded Cache Placement, 2020

   Proves the exact optimality of the MAN scheme under uncoded placement for $N \\ge K$. The proof uses an elegant induction argument on the number of users.

4. M. A. Yu and M. A. Maddah-Ali, Characterizing the Rate-Memory Tradeoff in Cache Networks Within a Factor of 2, 2018

   Establishes that the MAN scheme is within a factor of 2 of optimal even when coded placement is allowed. The best known general converse.

5. S. P. Shariatpanahi, S. A. Motahari, and B. H. Khalaj, Multi-Server Coded Caching, 2018

   Establishes the additive DoF result $L + t$ for multi-antenna coded caching. Shows that spatial multiplexing and coded multicasting gains are complementary.

6. M. Ji, G. Caire, and A. F. Molisch, Fundamental Limits of Caching in Wireless D2D Networks, 2016

   Establishes the throughput scaling law for D2D coded caching. Shows that per-user throughput is $\\Theta(M/N)$ independent of the number of users.

7. K. Wan, D. Tuninetti, M. Ji, and G. Caire, Fundamental Limits of Coded Caching with Correlated Sources, 2020

   Extends coded caching to correlated file libraries. Shows that correlation reduces the effective library size, preserving the coded multicasting gain.

8. K. Wan and G. Caire, On Coded Caching with Private Demands, 2021

   Introduces demand privacy to coded caching. Shows that privacy can be achieved with negligible overhead, using virtual-user padding.

9. E. Lampiris and P. Elia, Adding Transmitters Dramatically Boosts Coded-Caching Gains for Finite File Sizes, 2019

   Shows that adding transmit antennas can dramatically reduce the subpacketization requirement while maintaining the coded caching gain.

10. Q. Yan, M. Cheng, X. Tang, and Q. Chen, On the Placement Delivery Array Design for Centralized Coded Caching Scheme, 2017

    Introduces the placement delivery array (PDA) framework for reducing subpacketization. Provides systematic constructions with polynomial subpacketization.

Further Reading

• Coded caching textbook treatment

  M. A. Maddah-Ali and U. Niesen, 'Coded Caching,' in Information Theoretic Perspectives on 5G Systems, Cambridge University Press, 2022, Ch. 8

  The most comprehensive textbook treatment of coded caching by the original authors. Covers shared-link, multi-server, and decentralized settings with complete proofs.

• Subpacketization reduction techniques

  K. Shanmugam, M. Ji, A. M. Tulino, J. Llorca, and A. G. Dimakis, 'Finite-Length Analysis of Caching-Aided Coded Multicasting,' IEEE Trans. Inf. Theory, vol. 62, no. 10, pp. 5524-5537, Oct. 2016

  Analyzes coded caching with finite file sizes and develops practical schemes that reduce subpacketization using graph-theoretic methods.

• Online coded caching

  R. Pedarsani, M. A. Maddah-Ali, and U. Niesen, 'Online Coded Caching,' IEEE/ACM Trans. Netw., vol. 24, no. 2, pp. 836-845, Apr. 2016

  Extends coded caching to the online setting where demands arrive sequentially. The server must respond before seeing all demands, which reduces the multicast gain.

• Coded caching for video streaming

  N. Karamchandani, U. Niesen, M. A. Maddah-Ali, and S. N. Diggavi, 'Hierarchical Coded Caching,' IEEE Trans. Inf. Theory, vol. 62, no. 6, pp. 3212-3229, Jun. 2016

  Extends coded caching to hierarchical networks (tree topologies) relevant for CDN architectures. The coded caching gain is preserved across multiple hierarchy levels.

• Coded caching meets NOMA

  E. Piovano, H. Joudeh, and B. Clerckx, 'On Coded Caching in the Overloaded MISO Broadcast Channel,' IEEE Trans. Signal Process., vol. 68, pp. 2225-2240, 2020

  Combines coded caching with non-orthogonal multiple access (NOMA) and rate-splitting, showing that imperfect CSIT can be partially compensated by the coded caching gain.

• Full book on coded caching (CommIT perspective)

  The Ferkans Book CC (Coded Caching), available in this library

  For a complete treatment of coded caching systems, including all wireless extensions, D2D protocols, and practical implementations, see the dedicated Book CC in this library.