|
Computing the Capacity of Sum-networks with Dependent Sources
|
| |
|
|
|
چکیده: (352 مشاهده) |
A sum-network is a directed acyclic network with multiple sources and multiple sinks where each sink demands the sum of the independent information generated at the sources. The coding capacity of sum networks with independent sources has been investigated in Tripathy and Ramamoorthy(2015) and it was proven that the upper bound of the coding capacity of such networks is 1. In this paper, it is shown that the upper bound of the coding capacity of a sum network with dependent sources is greater than 1 which is different from the obtained results in Tripathy and Ramamoorthy(2015).
It is also shown that a non-solvable sum-network with independent sources can be converted to a solvable one when the sources have arbitrary dependencies |
|
| |
|
|
متن کامل [PDF 793 kb]
(235 دریافت)
|
نوع مطالعه: پژوهشی |
موضوع مقاله:
Discrete Optimization
دریافت: 1404/5/13 | پذیرش: 1404/7/12 | انتشار: 1404/7/12
|
|
|
|
|
|
|
| ارسال نظر درباره این مقاله |
|
|
|
