Campus Units

Electrical and Computer Engineering

Document Type

Conference Proceeding

Conference

2008 IEEE International Symposium on Information Theory

Publication Version

Accepted Manuscript

Link to Published Version

https://doi.org/10.1109/ISIT.2008.4595267

Publication Date

2008

Journal or Book Title

IEEE International Symposium on Information Theory, 2008. ISIT 2008.

First Page

1646

Last Page

1650

DOI

10.1109/ISIT.2008.4595267

Conference Title

2008 IEEE International Symposium on Information Theory

Conference Date

July 6-11, 2008

City

Toronto, CA

Abstract

We consider a network (that is capable of network coding) with a set of sources and terminals, where each terminal is interested in recovering the sum of the sources. Considering directed acyclic graphs with unit capacity edges and independent, unit-entropy sources, we show the rate region when (a) there are two sources and n terminals, and (b) n sources and two terminals. In these cases as long as there exists at least one path from each source to each terminal we demonstrate that there exists a valid assignment of coding vectors to the edges such that the terminals can recover the sum of the sources.

Comments

This is a manuscript of a proceeding from the IEEE International Symposium on Information Theory (2008): 1646, doi:10.1109/ISIT.2008.4595267. 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