Subspace properties of randomized network coding

Randomized network coding has network nodes randomly combine and exchange linear combinations of the source packets. A header appended to the packet, called coding vector, specifies the exact linear combination that each packet carries. The main contribution of this work is to investigate properties of the subspacesspanned by the collected coding vectors in each network node. We use these properties to exhibit the relationship between the network topology and the subspaces collected at the nodes. This allows us to passively infer the network topology for a general class of graphs.


Published in:
In Proceedings
Presented at:
IEEE Information Thory Workshop (ITW 2007), Lake Tahoe, CA, USA, September 2-6, 2007
Year:
2007
Laboratories:




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

n/a:
Download fulltext
PDF

Rate this document:

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