Record Details

Some results on communicating the sum of sources over a network

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title Some results on communicating the sum of sources over a network
 
Creator RAI, BK
DEY, BK
KARANDIKAR, A
 
Description We consider the problem of communicating the sum of m sources to n terminals in a directed acyclic network. Recently, it was shown that for a network of unit capacity links with either m = 2 or n = 2, the sum of the sources can be communicated to the terminals using scalar/vector linear network coding if and only if every source-terminal pair is connected in the network. We show in this paper that for any finite set of primes, there exists a network where the sum of the sources can be communicated to the terminals only over finite fields of characteristic belonging to that set. As a corollary, this gives networks where the sum can not be communicated over any finite field using vector linear network coding even though every source is connected to every terminal.
 
Publisher IEEE
 
Date 2011-10-25T01:18:06Z
2011-12-15T09:11:02Z
2011-10-25T01:18:06Z
2011-12-15T09:11:02Z
2009
 
Type Proceedings Paper
 
Identifier 2009 WORKSHOP ON NETWORK CODING, THEORY, AND APPLICATIONS,92-97
978-1-4244-4723-7
http://dx.doi.org/10.1109/NETCOD.2009.5191400
http://dspace.library.iitb.ac.in/xmlui/handle/10054/15566
http://hdl.handle.net/100/1808
 
Source 5th Workshop on Network Coding, Theory and Applications,Lausanne, SWITZERLAND,JUN 15-16, 2009
 
Language English