Presentation
Capacity of sum-networks for different message alphabets
2015 IEEE International Symposium on Information Theory (ISIT)
Document Type
Conference Proceeding
Disciplines
Conference
2015 IEEE International Symposium on Information Theory
Publication Version
Accepted Manuscript
Link to Published Version
https://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
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.
Rights
Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Copyright Owner
IEEE
Copyright Date
2015
Language
en
File Format
application/pdf
Citation Information
Ardhendu Tripathy and Aditya Ramamoorthy. "Capacity of sum-networks for different message alphabets" Hong Kong2015 IEEE International Symposium on Information Theory (ISIT) (2015) p. 606 - 610 Available at: http://works.bepress.com/aditya-ramamoorthy/1/
This is a manuscript of a proceeding from the IEEE International Symposium on Information Theory (2015): 606, doi:10.1109/ISIT.2015.7282526. Posted with permission.