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

Consider an assignment of bits to the vertices of a connected graph with the property that the
value of each vertex is a function of the values of its neighbors. A collection of such …

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 minrank of a directed graph G is the minimum rank of a matrix M that can be obtained
from the adjacency matrix of G by switching some ones to zeros (ie, deleting edges) and …

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 …

Storage codes on graphs are an instance of\emph {codes with locality}, which are used in
distributed storage schemes to provide local repairability. Specifically, the nodes of the …

Motivated by the established notion of storage codes, we consider sets of infinite sequences
over a finite alphabet such that every-tuple of consecutive entries is uniquely recoverable …

A storage code is an assignment of symbols to the vertices of a connected graph G (V, E)
with the property that the value of each vertex is a function of the values of its neighbors, or …

A storage code is an assignment of symbols to the vertices of a connected graph G (V, E)
with the property that the value of each vertex is a function of the values of its neighbors, or …

The index coding capacity is investigated through its structural properties. First, the capacity
is characterized in three new multiletter expressions involving the clique number, Shannon …