Communicating the sum of sources over a network - Computer Science > Information TheoryReport as inadecuate




Communicating the sum of sources over a network - Computer Science > Information Theory - Download this document for free, or read online. Document in PDF available to download.

Abstract: We consider a network that is capable of network coding with a set ofsources and terminals, where each terminal is interested in recovering the sumof the sources. Considering directed acyclic graphs with unit capacity edgesand independent, unit-entropy sources, we show the rate region when a thereare two sources and $n$ terminals, and b $n$ sources and two terminals. Inthese cases as long as there exists at least one path from each source to eachterminal we demonstrate that there exists a valid assignment of coding vectorsto the edges such that the terminals can recover the sum of the sources.



Author: Aditya Ramamoorthy

Source: https://arxiv.org/







Related documents