Communicating the sum of sources over a network
Information Theory
2008-05-02 v1 math.IT
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 terminals, and (b) 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.
Keywords
Cite
@article{arxiv.0805.0051,
title = {Communicating the sum of sources over a network},
author = {Aditya Ramamoorthy},
journal= {arXiv preprint arXiv:0805.0051},
year = {2008}
}
Comments
5 pages, Proceedings of the 2008 IEEE International Symposium on Information Theory, Toronto, ON, Canada, July 6 - 11, 2008