Skip to main content
Presentation
Sum-networks from undirected graphs: Construction and capacity analysis
2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton 2014)
  • Ardhendu Tripathy, Iowa State University
  • Aditya Ramamoorthy, Iowa State University
Document Type
Article
Publication Version
Accepted Manuscript
Link to Published Version
http://dx.doi.org/10.1109/ALLERTON.2014.7028517
Publication Date
1-1-2014
DOI
10.1109/ALLERTON.2014.7028517
Conference Title
52nd Annual Allerton Conference on Communication, Control, and Computing
Conference Date
September 30–October 3, 2014
Geolocation
(40.0278116, -88.57339789999997)
Abstract

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.

Comments

This proceeding is from Communication, Control, and Computing (Allerton), 2014 52nd Annual Allerton Conference on, Monticello, IL, 2014, pp. 651-658, doi:10.1109/ALLERTON.2014.7028517. Posted with permission.

Copyright Owner
IEEE
Language
en
File Format
application/pdf
Citation Information
Ardhendu Tripathy and Aditya Ramamoorthy. "Sum-networks from undirected graphs: Construction and capacity analysis" Monticello, IL, United States2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton 2014) (2014) p. 651 - 658
Available at: http://works.bepress.com/ardhendu-tripathy/2/