Multiaccess Coded Caching with Private Demands

Liang, Dequan; Wan, Kai; Cheng, Minquan; Caire, Giuseppe

doi:10.1109/isit50566.2022.9834460

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

2024

Publication Types

Select...

Article3

Other2

Relationship

Self Cite1

Independent4

Authors

Journals

Cited by 6 publications

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Coded Caching Schemes for Multi-Access Topologies via Combinatorial Design Theory

Cheng,

Wan,

Elia

et al. 2023

2023 IEEE International Symposium on Information Theory (ISIT)

Self Cite

View full text Add to dashboard Cite

This paper studies a novel multi-access coded caching (MACC) model where the topology between users and cache nodes is a generalization of those already studied in previous work, such as combinatorial and cross-resolvable design topologies. Our goal is to minimize the worst-case transmission load in the delivery phase from the server over all possible user requests. By formulating the access topology as two classical combinatorial structures, t-design and t-group divisible design, we propose two classes of coded caching schemes for a flexible number of users, where the number of users can scale linearly, polynomially or exponentially with the number of cache nodes. In addition, our schemes can unify most schemes for the shared link network and unify many schemes for the multi-access network except for the cyclic wrap-around topology.

show abstract