Network Coding With Computation Alignment
Determining the capacity of multi-receiver networks with arbitrary message demands is an open problem in the network coding literature. In this paper, the authors consider a multisource, multi-receiver symmetric deterministic network model parameterized by channel coefficients (inspired by wireless network flow) in which the receivers compute a sum of the symbols generated at the sources. Scalar and vector linear coding strategies are analyzed. It is shown that computation alignment over finite field vector spaces is necessary to achieve the computation capacities in the network.