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 …

The problem of two-sender unicast index coding consists of two senders and a set of
receivers. Each receiver demands a unique message not demanded by any other receiver …

An index coding (IC) problem consisting of a server and multiple receivers with different side-
information and demand sets can be equivalently represented using a fitting matrix. A scalar …

Partial clique covering is one of the most basic coding schemes for index coding problems,
generalizing clique and cycle covering on the side information digraph and further reducing …

Circular perfect graphs are those undirected graphs such that the circular clique number is
equal to the circular chromatic number for each induced subgraph. They form a strict …

One of the major challenges for information theorists is to build such communication
schemes which allow participants to communicate efficiently. Index Coding, which was first …

Circular perfect graphs are those undirected graphs such that the circular clique number is
equal to the circular chromatic number for each induced subgraph. They form a strict …

In index coding, a sender broadcasts messages through a noiseless broadcast channel to
multiple receivers, each possessing a subset of the messages a priori, known as …