On the optimality of uncoded cache placement

K Wan, D Tuninetti, P Piantanida - 2016 IEEE Information …, 2016 - ieeexplore.ieee.org
Caching is an effective way to reduce peak-hour network traffic congestion by storing some
contents at user's local cache. Maddah-Ali and Niesen (MAN) initiated a fundamental study …

On caching with more users than files

K Wan, D Tuninetti, P Piantanida - 2016 IEEE International …, 2016 - ieeexplore.ieee.org
Caching is an efficient way to reduce peak hour network traffic congestion by storing some
content at the user's cache without knowledge of later demands. Recently, Maddah-Ali and …

Fundamentals of index coding

F Arbabjolfaei, YH Kim - Foundations and Trends® in …, 2018 - nowpublishers.com
Index coding is a canonical problem in network information theory that studies the
fundamental limit and optimal coding schemes for broadcasting multiple messages to …

Local time sharing for index coding

F Arbabjolfaei, YH Kim - 2014 IEEE International Symposium …, 2014 - ieeexplore.ieee.org
A series of extensions of the index coding schemes based on time sharing by Birk and Kol,
by Blasiak, Kleinberg, and Lubetzky, and by Shanmugam, Dimakis, and Langberg are …

Cooperative multi-sender index coding

M Li, L Ong, SJ Johnson - IEEE Transactions on Information …, 2018 - ieeexplore.ieee.org
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 …

Multi-sender index coding for collaborative broadcasting: A rank-minimization approach

M Li, L Ong, SJ Johnson - IEEE Transactions on …, 2018 - ieeexplore.ieee.org
We consider a Multi-Sender Unicast Index-Coding (MSUIC) problem, where in a broadcast
network, multiple senders collaboratively send distinct messages to multiple receivers, each …

Improved bounds for multi-sender index coding

M Li, L Ong, SJ Johnson - 2017 IEEE International Symposium …, 2017 - ieeexplore.ieee.org
We establish new capacity bounds for the multi-sender unicast index-coding problem. We
first revisit existing bounds proposed by Sadeghi et al. and identify the suboptimality of their …

Approximate capacity of index coding for some classes of graphs

F Arbabjolfaei, YH Kim - 2016 IEEE International Symposium …, 2016 - ieeexplore.ieee.org
For a class of index coding problems with side information graph having the Ramsey
number R (i, j) upper bounded by ci ajb, it is shown that the clique covering scheme …

Three-layer composite coding for index coding

Y Liu, P Sadeghi, YH Kim - 2018 IEEE Information Theory …, 2018 - ieeexplore.ieee.org
We extend the composite coding (CC) scheme for the index coding problem from two layers
to more layers of random binning. We explicitly introduce the three-layer composite coding …

[图书][B] Index coding: Fundamental limits, coding schemes, and structural properties

F Arbabjolfaei - 2017 - search.proquest.com
Originally introduced to minimize the number of transmissions in satellite communication,
index coding is a canonical problem in network information theory that studies the …