Distributed Function Computation Over a Rooted Directed Tree
Reads0
Chats0
TLDR
This paper establishes the capacity region for a class of source coding function computation setups, where sources of information are available at the nodes of a tree and where a function of these sources must be computed at its root.Abstract:
This paper establishes the capacity region for a class of source coding function computation setups, where sources of information are available at the nodes of a tree and where a function of these sources must be computed at its root. The capacity region holds for any function as long as the sources’ joint distribution satisfies a certain Markov criterion. This criterion is met, in particular, when the sources are independent. This result recovers the capacity regions of several function computation setups. These include the point-to-point communication setting with arbitrary sources, the noiseless multiple access network with conditionally independent sources, and the cascade network with Markovian sources.read more
Citations
More filters
Journal ArticleDOI
CONDENSE: A Reconfigurable Knowledge Acquisition Architecture for Future 5G IoT
Dejan Vukobratovic,Dusan Jakovetic,Vitaly Skachek,Dragana Bajovic,Dino Sejdinovic,Gunes Karabulut Kurt,Camilla Hollanti,Ingo Fischer +7 more
TL;DR: A novel architecture dubbed Condense is proposed which integrates the IoT-communication infrastructure into the data analysis via the generic concept of network function computation, and the relevant literature on computing atomic functions in both analog and digital domains is surveyed.
Journal ArticleDOI
On Function Computation With Privacy and Secrecy Constraints
Wenwen Tu,Lifeng Lai +1 more
TL;DR: This paper introduces a quantity to precisely measure the privacy leakage to the fusion center and has a secrecy constraint to Eve and uses equivocation of sources to measure this quantity.
Posted Content
Overhead Performance Tradeoffs - A Resource Allocation Perspective
TL;DR: It is shown that information rate savings can be obtained by recognizing that the controller only needs to determine the result of this extremization function, and simple achievable schemes for both the lossy and interactive variants of this problem are considered.
Journal ArticleDOI
Overhead Performance Tradeoffs—A Resource Allocation Perspective
TL;DR: In this article, it is shown that information rate savings can be obtained by recognizing that the controller only needs to determine the result of this extremization function, and that the rate savings are shown in most cases to be at most 2 b independent of the number of competing users.
Proceedings ArticleDOI
Multiple Access Channel Simulation
TL;DR: In this article, the authors study the problem of simulating a multiple access channel over a network of noiseless links, where the decoder has to output approximately i.i.d. copies of another random variable.
References
More filters
Journal ArticleDOI
Noiseless coding of correlated information sources
David Slepian,Jack K. Wolf +1 more
TL;DR: The minimum number of bits per character R_X and R_Y needed to encode these sequences so that they can be faithfully reproduced under a variety of assumptions regarding the encoders and decoders is determined.
Book
Network Information Theory
Abbas El Gamal,Young-Han Kim +1 more
TL;DR: In this article, a comprehensive treatment of network information theory and its applications is provided, which provides the first unified coverage of both classical and recent results, including successive cancellation and superposition coding, MIMO wireless communication, network coding and cooperative relaying.
Book
Communication Complexity
Eyal Kushilevitz,Noam Nisan +1 more
TL;DR: This chapter surveys the theory of two-party communication complexity and presents results regarding the following models of computation: • Finite automata • Turing machines • Decision trees • Ordered binary decision diagrams • VLSI chips • Networks of threshold gates.
DissertationDOI
Problems in Decentralized Decision making and Computation.
TL;DR: A scheme whereby a set of decision makers (processors) exchange and update tentative decisions which minimize a common cost function, given information they possess is considered; it is shown that they are guaranteed to converge to consensus.