Distributed Function Computation Over a Rooted Directed Tree

作者: Milad Sefidgaran , Aslan Tchamkerten

DOI:

关键词: Source codeAccess networkFunction (mathematics)Markov processMarkov chainAlgorithmJoint probability distributionMathematicsConditional independenceMathematical optimizationTree (data structure)

摘要: This paper establishes the rate region for a class of source coding function computation setups where sources information are available at nodes tree and these must be computed root. The holds any as long sources' joint distribution satisfies certain Markov criterion. criterion is met, in particular, when independent. This result recovers regions several setups. These include point-to-point communication setting with arbitrary sources, noiseless multiple access network "conditionally independent sources," cascade Markovian sources.

参考文章(3)
Andrew Chi-Chih Yao, Some complexity questions related to distributive computing(Preliminary Report) symposium on the theory of computing. pp. 209- 213 ,(1979) , 10.1145/800135.804414
K Zeger, R Appuswamy, N Karamchandani, M Franceschetti, Network Coding for Computing: Cut-Set Bounds IEEE Transactions on Information Theory. ,vol. 57, pp. 1015- 1030 ,(2011) , 10.1109/TIT.2010.2095070
A. Orlitsky, J.R. Roche, Coding for computing international symposium on information theory. ,vol. 47, pp. 903- 917 ,(1995) , 10.1109/18.915643