Skip to main content
Presentation
Capacity of sum-networks for different message alphabets
Information Theory (ISIT), 2015 IEEE International Symposium on
  • Ardhendu Tripathy, Iowa State University
  • Aditya Ramamoorthy, Iowa State University
Document Type
Conference Proceeding
Publication Version
Accepted Manuscript
Link to Published Version
http://dx.doi.org/10.1109/ISIT.2015.7282526
Publication Date
1-1-2015
DOI
10.1109/ISIT.2015.7282526
Conference Title
2015 IEEE International Symposium on Information Theory (ISIT)
Conference Date
June 14–19, 2015
Geolocation
(22.396428, 114.10949700000003)
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.

Comments

This is the accepted manuscript of a proceeding is from 2015 IEEE International Symposium on Information Theory (ISIT), Hong Kong, 2015, pp. 606-610. doi:10.1109/ISIT.2015.7282526. Posted with permission.

Copyright Owner
IEEE
Language
en
File Format
application/pdf
Citation Information
Ardhendu Tripathy and Aditya Ramamoorthy. "Capacity of sum-networks for different message alphabets" Hong KongInformation Theory (ISIT), 2015 IEEE International Symposium on (2015) p. 606 - 610
Available at: http://works.bepress.com/ardhendu-tripathy/3/