Capacity of sum-networks for different message alphabets
- 1 June 2015
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 606-610
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.Keywords
All Related Versions
This publication has 10 references indexed in Scilit:
- Capacity of sum-networks for different message alphabets2015
- Sum-networks from undirected graphs: Construction and capacity analysis2014
- On the capacity of sum-networks2013
- Communicating the Sum of Sources Over a NetworkIEEE Journal on Selected Areas in Communications, 2013
- Linear Codes, Target Function Classes, and Network Computing CapacityIEEE Transactions on Information Theory, 2013
- On Network Coding for Sum-NetworksIEEE Transactions on Information Theory, 2012
- Network Coding for Computing: Cut-Set BoundsIEEE Transactions on Information Theory, 2011
- Linear Network Codes and Systems of Polynomial EquationsIEEE Transactions on Information Theory, 2008
- Network routing capacityIEEE Transactions on Information Theory, 2006
- Insufficiency of Linear Coding in Network Information FlowIEEE Transactions on Information Theory, 2005