The Exact Load-Memory Tradeoff of Multi-Access Coded Caching With Combinatorial Topology - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

The Exact Load-Memory Tradeoff of Multi-Access Coded Caching With Combinatorial Topology

Petros Elia

Résumé

Recently, Muralidhar et al. proposed a novel multiaccess system model where each user is connected to multiple caches in a manner that follows the well-known combinatorial topology of combination networks. For such multi-access topology, the same authors proposed an achievable scheme, which stands out for the unprecedented coding gains even with very modest cache resources. In this paper, we identify the fundamental limits of such multi-access setting with exceptional potential, providing an information-theoretic converse which establishes, together with the inner bound by Muralidhar et al., the exact optimal performance under uncoded prefetching.
Fichier principal
Vignette du fichier
publi-6808.pdf (291.36 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04095017 , version 1 (11-05-2023)

Identifiants

Citer

Federico Brunero, Petros Elia. The Exact Load-Memory Tradeoff of Multi-Access Coded Caching With Combinatorial Topology. ISIT 2022, IEEE International Symposium on Information Theory, Jun 2022, Espoo, Finland. pp.1701-1706, ⟨10.1109/ISIT50566.2022.9834536⟩. ⟨hal-04095017⟩

Collections

EURECOM
11 Consultations
9 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More