Sum-networks from undirected graphs: Construction and capacity analysis

摘要: We consider a directed acyclic network with multiple sources and terminals where each terminal is interested in decoding the sum of independent generated at source nodes. describe procedure whereby simple undirected graph can be used to construct such sum-network demonstrate an upper bound on its computation rate. Furthermore, we show sufficient conditions for construction linear code that achieves this bound. Our allows us sum-networks have any arbitrary rate p/q (where p, q are non-negative integers). work significantly generalizes previous approach constructing capacities. Specifically, answer open question prior by demonstrating fewer number terminals.