Capacity of sum-networks for different message alphabets2015 IEEE International Symposium on Information Theory (ISIT)
Document TypeConference Proceeding
Conference2015 IEEE International Symposium on Information Theory
Publication VersionAccepted Manuscript
Link to Published Versionhttps://doi.org/10.1109/ISIT.2015.7282526
Conference Title2015 IEEE International Symposium on Information Theory
Conference DateJune 14–19, 2015
AbstractA 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.
RightsPersonal 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.
Citation InformationArdhendu 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/ardhendu-tripathy/3/