The work explores the fundamental limits of coded caching in the setting where a transmitter
with potentially multiple (N 0) antennas serves different users that are assisted by a smaller …

Index coding is a canonical problem in network information theory that studies the
fundamental limit and optimal coding schemes for broadcasting multiple messages to …

Cache-aided content delivery is studied in a multi-server system with P servers and K users,
each equipped with a local cache memory. In the delivery phase, each user connects …

The centralized coded caching problem is studied for the two-user scenario, considering
heterogeneous cache capacities at the users and private channels from the server to the …

Data shuffling of training data among different computing nodes (workers) has been
identified as a core element to improve the statistical performance of modern large-scale …

Caching and cloud control are new technologies that were suggested to improve the
performance of future wireless networks. Fog radio access networks (F-RANs) have been …

In this paper, we propose a new coding scheme and establish new bounds on the capacity
region for the multi-sender unicast index-coding problem. We revisit existing partitioned …

This paper studies the Pliable Index CODing problem (PICOD), which models content-type
distribution networks. In the PICOD (t) problem there are m messages, n users and each …

The work explores the fundamental limits of coded caching in heterogeneous networks
where multiple ($ N_0 $) senders/antennas, serve different users which are associated …

Motivated by applications in distributed storage and distributed computation, we introduce
embedded index coding (EIC). EIC is a type of distributed index coding in which nodes in a …