References & Further Reading

References

  1. J. Hachem, N. Karamchandani, and S. Diggavi, Coded Caching for Multi-Level Popularity and Access, 2017

    Foundational multi-access coded caching paper. Establishes the HKD cyclic wrap-around scheme with rate $R_\text{MA} = K(1 - LM/N)/(1 + KLM/N)$. Core of Chapter 18.

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

    MAN scheme — baseline for multi-access extensions.

  3. S. Katyal and B. S. Ramkumar, Multi-Access Coded Caching via Combinatorial Designs, 2021

    Resolvable-design-based multi-access schemes. Generalizes HKD cyclic to broader topologies.

  4. K. Ma and D. Tuninetti, On the Coded Caching Problem with Multi-Access Topologies, 2019

    Latin-square-based improvements over HKD for specific regimes.

  5. B. Serbetci, E. Parrinello, and P. Elia, Multi-Access Coded Caching: Fundamental Limits and Code Constructions, 2019

    Converse bounds for multi-access; improved achievable.

  6. K. Wan and G. Caire, Multi-Tier Multi-Access Coded Caching, 2023

    CommIT extension to multi-tier MEC networks. Important for 5G/6G deployment.

  7. K. Wan, G. Caire, Multi-Tier Multi-Access Coded Caching with Applications to 5G MEC, 2023

    Same paper, alternative citation for §18.4.

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

    D2D caching (Ch 10-11). Contrast with multi-access in §18.4.

  9. T. P. Kirkman, On a Problem in Combinatorics, 1850

    Original Kirkman Triple System paper. Historical source for §18.3 combinatorial designs.

  10. C. J. Colbourn and J. H. Dinitz (eds.), Handbook of Combinatorial Designs (2nd ed.), 2007

    Canonical reference for BIBDs, resolvable designs, Kirkman triples. Background for §18.3.

  11. E. Parrinello, A. Unsal, and P. Elia, Fundamental Limits of Coded Caching with Multiple Antennas, Shared Caches, and Uncoded Prefetching, 2019

    Multi-antenna × multi-access interactions.

  12. 3GPP Technical Specification Group, 5G System Enhancement for Edge Computing, 2023

    MEC APIs that support coordinated multi-access caching. Relevant for §18.4.

Further Reading

Resources for deeper study of multi-access coded caching.

  • Foundational HKD paper

    Hachem, Karamchandani, Diggavi (2017). 'Coded Caching for Multi-Level Popularity and Access,' IEEE TIT

    Core paper for Chapter 18. Establishes HKD cyclic scheme.

  • Resolvable designs survey

    Colbourn, Dinitz (2007). 'Handbook of Combinatorial Designs'

    Comprehensive reference for the combinatorial objects used in §18.3.

  • CommIT multi-tier extension

    Wan, Caire (2023). 'Multi-Tier Multi-Access Coded Caching'

    CommIT contribution; application to 5G MEC.

  • Multi-access vs D2D comparison

    Ji, Caire, Molisch (2016); Hachem, Karamchandani, Diggavi (2017)

    Complementary chapters (10-11 and 18) — understand when each model applies.

ExercisesCh 19 →