Network coding theory: A survey
This article surveys all known fields of network coding theory and leads the reader through
the antecedents of the network coding theory to the most recent results, considering also …
the antecedents of the network coding theory to the most recent results, considering also …
Fundamental limits of caching
MA Maddah-Ali, U Niesen - IEEE Transactions on information …, 2014 - ieeexplore.ieee.org
Caching is a technique to reduce peak traffic rates by prefetching popular content into
memories at the end users. Conventionally, these memories are used to deliver requested …
memories at the end users. Conventionally, these memories are used to deliver requested …
Decentralized coded caching attains order-optimal memory-rate tradeoff
MA Maddah-Ali, U Niesen - IEEE/ACM Transactions On …, 2014 - ieeexplore.ieee.org
Replicating or caching popular content in memories distributed across the network is a
technique to reduce peak network loads. Conventionally, the main performance gain of this …
technique to reduce peak network loads. Conventionally, the main performance gain of this …
Coded caching with nonuniform demands
U Niesen, MA Maddah-Ali - IEEE Transactions on Information …, 2016 - ieeexplore.ieee.org
We consider a network consisting of a file server connected through a shared link to a
number of users, each equipped with a cache. Knowing the popularity distribution of the …
number of users, each equipped with a cache. Knowing the popularity distribution of the …
Online coded caching
R Pedarsani, MA Maddah-Ali… - IEEE/ACM Transactions …, 2015 - ieeexplore.ieee.org
We consider a basic content distribution scenario consisting of a single origin server
connected through a shared bottleneck link to a number of users each equipped with a …
connected through a shared bottleneck link to a number of users each equipped with a …
Instantly decodable network coding: From centralized to device-to-device communications
From its introduction to its quindecennial, network coding has built a strong reputation for
enhancing packet recovery and achieving maximum information flow in both wired and …
enhancing packet recovery and achieving maximum information flow in both wired and …
Finite-length analysis of caching-aided coded multicasting
We study a noiseless broadcast link serving K users whose requests arise from a library of N
files. Every user is equipped with a cache of size M files each. It has been shown that by …
files. Every user is equipped with a cache of size M files each. It has been shown that by …
On the index coding problem and its relation to network coding and matroid theory
S El Rouayheb, A Sprintson… - IEEE Transactions on …, 2010 - ieeexplore.ieee.org
The index coding problem has recently attracted a significant attention from the research
community due to its theoretical significance and applications in wireless ad hoc networks …
community due to its theoretical significance and applications in wireless ad hoc networks …
An equivalence between network coding and index coding
M Effros, S El Rouayheb… - IEEE Transactions on …, 2015 - ieeexplore.ieee.org
We show that the network coding and index coding problems are equivalent. This
equivalence holds in the general setting which includes linear and nonlinear codes …
equivalence holds in the general setting which includes linear and nonlinear codes …
Completion delay minimization for instantly decodable network codes
In this paper, we consider the problem of minimizing the completion delay for instantly
decodable network coding (IDNC) in wireless multicast and broadcast scenarios. We are …
decodable network coding (IDNC) in wireless multicast and broadcast scenarios. We are …