Conference Proceeding

Function computation via subspace coding

Dept. of Electr. & Comput. Eng., UCSD, La Jolla, CA, USA
07/2010; DOI:10.1109/ISIT.2010.5513755 pp.2398 - 2402 In proceeding of: Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on
Source: IEEE Xplore

ABSTRACT This paper considers function computation in a network where intermediate nodes perform randomized network coding, through appropriate choice of the subspace codebooks at the source nodes. Unlike traditional network coding for computing functions, that requires intermediate nodes to be aware of the function to be computed, our designs are transparent to the intermediate node operations.

0 0
 · 
0 Bookmarks
 · 
24 Views
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.

Keywords

appropriate choice
 
aware
 
designs
 
function computation
 
randomized network coding
 
requires intermediate nodes
 
source nodes
 
subspace codebooks
 
traditional network coding