Name
Abstract | ||
|---|---|---|
The problem of network function computation over a directed acyclic network is investigated in this paper. In such a network, a sink node desires to compute with zero error a target function, of which the inputs are generated at multiple source nodes. The computing rate of a network code that can compute the target function over the network is the average number of times that the target function is computed with zero error for one use of the network. In this paper, we obtain an improved upper bound on the computing capacity, which is applicable to arbitrary target functions and arbitrary network topologies. By applying this bound to the problem of computing a vector-linear function over a network, we are able to not only enhance a previous result on computing a vector-linear function over a network but also simplify the proof significantly. Finally, we prove that for computing the binary maximum function over the reverse butterfly network, our improved upper bound is not achievable. This result establishes that in general our improved upper bound is non achievable, but whether it is asymptotically achievable or not remains open. |
Year | Venue | Field |
|---|---|---|
2018 | 2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) | Discrete mathematics,Topology,Upper and lower bounds,Network code,Computer science,Function computation,Network topology,Butterfly network,Sink (computing),Binary number |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xuan Guang | 1 | 7 | 4.22 |
| Raymond W. Yeung | 2 | 4302 | 580.31 |
| Shenghao Yang | 3 | 128 | 15.00 |
| Congduan Li | 4 | 40 | 7.75 |