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 bounded as deltai(T - delta1 - delta2), where deltai 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.


Published in:
In Proceedings IEEE Information Thory Workshop , 130-134
Presented at:
IEEE Information Thory Workshop (ITW 2009), Volos, Greece, June 10-12, 2009
Year:
2009
Publisher:
Volos, Greece
Laboratories:




 Record created 2009-11-19, last modified 2018-03-17

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)