Electrical and Computer Engineering
Link to Published Version
Journal or Book Title
2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton 2014)
52nd Annual Allerton Conference on Communication, Control, and Computing
September 30–October 3, 2014
Monticello, IL, United States
We consider a directed acyclic network with multiple sources and multiple terminals where each terminal is interested in decoding the sum of independent sources generated at the source nodes. We describe a procedure whereby a simple undirected graph can be used to construct such a sum-network and demonstrate an upper bound on its computation rate. Furthermore, we show sufficient conditions for the construction of a linear network code that achieves this upper bound. Our procedure allows us to construct sum-networks that have any arbitrary computation rate p/q (where p, q are non-negative integers). Our work significantly generalizes a previous approach for constructing sum-networks with arbitrary capacities. Specifically, we answer an open question in prior work by demonstrating sum-networks with significantly fewer number of sources and terminals.
Tripathy, Ardhendu and Ramamoorthy, Aditya, "Sum-networks from undirected graphs: Construction and capacity analysis" (2014). Electrical and Computer Engineering Conference Papers, Posters and Presentations. 13.