Sum-networks: system of polynomial equations, reversibility, insufficiency of linear network coding, unachievability of coding capacity
Brijesh Kumar, Bikash Kumar Dey · arXiv (Cornell University) · 2009
A directed acyclic network is considered where all the terminals demand the sum of the symbols generated at all the sources. We call such a network as a sum-network. It is shown that there exists a solvably (and linear solvably) equivalent sum-network for any multiple-unicast network (and more generally, for any acyclic directed network where each terminal node demands a subset of the symbols generated at all the sources). It is also shown that there exists a linear solvably equivalent multiple-un icast network for every sum-network. As a consequence, many known results for multiple-unicast networks also hold for sum-networks. Specifically, it is shown that for any set of polynomials having integer coefficients, there exist s a sum-network which is scalar linear solvable over a finite field F if and only if the polynomials have a common root in F . Similarly, the insufficiency of linear network coding and unachievability of the network coding capacity is proved for sum-networks. It is shown that there exists a solvable sum-network whose reverse network is not solvable. On the other hand, a sum-network and its reverse network are shown to be solvably equivalent under fractional vector linear network coding.