Campus Units

Electrical and Computer Engineering

Document Type

Conference Proceeding

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

2015

Journal or Book Title

2015 IEEE International Symposium on Information Theory (ISIT)

First Page

606

Last Page

610

DOI

10.1109/ISIT.2015.7282526

Conference Title

2015 IEEE International Symposium on Information Theory

Conference Date

June 14–19, 2015

City

Hong Kong

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 a manuscript of a proceeding from the IEEE International Symposium on Information Theory (2015): 606, doi:10.1109/ISIT.2015.7282526. Posted with permission.

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

Language

en

File Format

application/pdf

Published Version

Share

Article Location

 
COinS