The intersession network coding problem, which is also known as the multiple source network coding problem is a challenging topic, and has attracted significant attention from the network coding community. In this paper, we study the encoding complexity for intersession network coding with two simple multicast sessions. The encoding complexity is characterized from two aspects: the number of en...

P.3 Section

Since the pioneer work in [1], the throughput capacity of random wireless networks has been studied extensively in the literature. Nevertheless, most existing studies are based on the assumption that each transmission has one sender and one receiver. In our recent study, we have proposed a fundamentally different transmission scheme, i.e., the cooperative network coding scheme, in which data on...

It is already known that in multicast (single source, multiple sinks) network, random linear network coding can achieve the maximum flow upper bound. In this paper, we investigate how random linear network coding behaves in general multi-source multi-sink case, where each sink has different demands, and we characterize all achievable rate of random linear network coding by a simple maximum flow...