Multicast capacity of multiple access erasure networks

Multi-source erasure networks with source precoding and random linear network coding

“…1 is asymptotically achievable with a sufficiently large number of time extensions. Furthermore, it can be easily observed that the destination can decode all symbols by solving linear equations given in (7). This thus completes the proof of Proposition 1.…”

“…Erasure networks with interference was considered in [6] for unicast networks and the duality between broadcast and interference has also been discussed in [6]. Later, the result in [6] was extended to multi-source single-sink erasure networks in [7]. The non-erasable networks with both broadcast at the transmitters and interference at the receivers have been studied in [8].…”

Analysis and design of multi-session network coding

“…The capacity of multiple-source single-receiver erasure networks has been obtained in [53], which has a nice max-flow min-cut interpretation. Single-source single-receiver erasure networks with finite-field additive interference has been investigated in [104], which was later extended to multiple-source single-receiver erasure networks in [105]. In the first part of this chapter, we derive an analytical expression for the throughput of single-session multicast erasure networks with finite-length spatial-temporal network coding.…”

“…To achieve the capacity for general deterministic multi-session networks, temporal network coding, i.e., coding over the packets arriving at successive time slots is necessary in general [107]. For erasure networks considered in [53,56,104,105], spatial-temporal network coding across infinite number of time slots is needed to achieve the network capacity.…”