Capacity of Sum-Networks for Different Message Alphabets
Abstract
A sum-network is a directed acyclic network in which all terminal nodes demand the 'sum' of the independent information observed at the source nodes. Many characteristics of the well-studied multiple-unicast network communication problem also hold for sum-networks due to a known reduction between instances of these two problems. Our main result is that unlike a multiple unicast network, the coding capacity of a sum-network is dependent on the message alphabet. We demonstrate this using a construction procedure and show that the choice of a message alphabet can reduce the coding capacity of a sum-network from 1 to close to 0.
Recommended Citation
A. S. Tripathy and A. Ramamoorthy, "Capacity of Sum-Networks for Different Message Alphabets," IEEE International Symposium on Information Theory - Proceedings, pp. 606 - 610, Institute of Electrical and Electronics Engineers (IEEE), Sep 2015.
The definitive version is available at https://doi.org/10.1109/ISIT.2015.7282526
Meeting Name
2015 IEEE International Symposium on Information Theory, ISIT (2015: Jun. 14-19, Hong Kong)
Department(s)
Computer Science
Keywords and Phrases
Capacity; Function Computation; Linear Network Coding; Network Coding; Sum-Network
International Standard Book Number (ISBN)
978-146737704-1
International Standard Serial Number (ISSN)
2157-8095
Document Type
Article - Conference proceedings
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2015 Institute of Electrical and Electronics Engineers (IEEE), All rights reserved.
Publication Date
28 Sep 2015
Comments
This work was supported in part by NSF grants CCF-1320416 and CCF-1149860.