Simplification methods are introduced for composite coding, which is an existing layered
random coding technique for the index coding problem. As the problem size grows, the …

The index coding problem studies the fundamental limit on broadcasting multiple messages
to their respective receivers with different sets of side information that are represented by a …

In this paper, we study the information-theoretic converse for the index coding problem. We
generalize the definition for the alignment chain, introduced by Maleki et al., to capture more …

The thesis consists of research in mixed integer linear programming with applications to
scheduling and matrix completion. We first study the problem of scheduling drilling and …

Compress-forward (CF) schemes are studied in general networks. The CF rate for the one-
relay channel defines outerbounds on both the CF rate for general networks and the …

Pliable index coding (PICOD) has recently been regarded as a promising solution that
exploits the coding advantage to improve communication efficiency of content-type systems …

We study the information leakage to a guessing adversary in index coding with a general
message distribution. Under both vanishing-error and zero-error decoding assumptions, we …

Dataset reshuffling across mobile devices allows for speeding up on-device distributed
machine learning, which however requires significant communication bandwidth. In this …

Caching has shown to be an excellent expedient for the purposes of reducing the traffic load
in data networks. An information-theoretic study of caching, known as coded caching …

In this work, we study the secure index coding problem where there are security constraints
on both legitimate receivers and eavesdroppers. We develop two performance bounds (ie …