On the capacity of multisource non-coherent network coding
We consider multisource non-coherent network coding, where multiple sources send information to one or multiple receivers. We prove that this is equivalent to a ldquosubspacerdquo channel, that takes subspaces as inputs and outputs. We then show that the rate of each individual receiver is upper bou...
Saved in:
Published in | 2009 IEEE Information Theory Workshop on Networking and Information Theory pp. 130 - 134 |
---|---|
Main Authors | , , , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
01.06.2009
|
Subjects | |
Online Access | Get full text |
ISBN | 1424445353 9781424445356 |
DOI | 10.1109/ITWNIT.2009.5158556 |
Cover
Loading…
Summary: | We consider multisource non-coherent network coding, where multiple sources send information to one or multiple receivers. We prove that this is equivalent to a ldquosubspacerdquo channel, that takes subspaces as inputs and outputs. We then show that the rate of each individual receiver is upper bounded as delta i (T - delta 1 - delta 2 ), where delta i is what we define to be the ldquodominatingrdquo dimension in the subspace codebook of source i, and T is the ldquocoherencerdquo time of the network. |
---|---|
ISBN: | 1424445353 9781424445356 |
DOI: | 10.1109/ITWNIT.2009.5158556 |