We characterize the capacity region of the two-user broadcast packet erasure channel
(PEC) with single-user delayed channel state information (CSI). More precisely, we assume …

The problem of network function computation over a directed acyclic network is investigated
in this paper. In such a network, a sink node desires to compute with zero error a target …

The characterization of information rate region for a network is seemed as the holy grail of
network information theory. Existing studies mostly focused on theoretical analysis on the …

One of the important unsolved problems in information theory is the conjecture that the
undirected multiple-unicast network information capacity is the same as the routing capacity …

A storage code over a graph maps independent source symbols, each of bits, to coded
symbols, each of bits, such that each coded symbol is stored in a node of the graph and …

For a special class of three unicast sessions, in which the maximum flow from each sender
to each receiver is the same positive integer k, a network coding approach is proposed. A …

For general connections, the problem of finding network codes and optimizing resources for
those codes is intrinsically difficult and a little is known about its complexity. Most of the …

The rate of a network code is the ratio of the block size of the network's messages to that of
its edge codewords. We compare the linear capacities and achievable rate regions of …

The problem of finding network codes for general connections is inherently difficult in
capacity constrained networks. Resource minimization for general connections with network …

In this paper, we present a new technique to obtain upper bounds on undirected unicast
network information capacity. Using this technique, we characterize an upper bound, called …