English
Related papers

Related papers: Interactive Function Computation with Reconstructi…

200 papers

Computation codes in network information theory are designed for the scenarios where the decoder is not interested in recovering the information sources themselves, but only a function thereof. K\"orner and Marton showed for distributed…

Information Theory · Computer Science 2017-07-28 Jingge Zhu , Sung Hoon Lim , Michael Gastpar

This paper considers the problem of lossy compression for the computation of a function of two correlated sources, both of which are observed at the encoder. Due to presence of observation costs, the encoder is allowed to observe only…

Information Theory · Computer Science 2013-07-22 Xi Liu , Osvaldo Simeone , Elza Erkip

For the emerging Internet of Things (IoT), one of the most critical problems is the real-time reconstruction of signals from a set of aged measurements. During the reconstruction, distortion occurs between the observed signal and the…

Information Theory · Computer Science 2019-01-25 Meng Wang , Wei Chen , Anthony Ephremides

This paper investigates a lossy source coding problem in which two decoders can access their side-information respectively. The correlated sources are a product of two component correlated sources, and we exclusively investigate the case…

Information Theory · Computer Science 2013-05-29 Shun Watanabe

We consider the semantic rate-distortion problem motivated by task-oriented video compression. The semantic information corresponding to the task, which is not observable to the encoder, shows impacts on the observations through a joint…

Information Theory · Computer Science 2022-08-15 Tao Guo , Yizhu Wang , Jie Han , Huihui Wu , Bo Bai , Wei Han

We study the limits of communication efficiency for function computation in collocated networks within the framework of multi-terminal block source coding theory. With the goal of computing a desired function of sources at a sink, nodes…

Information Theory · Computer Science 2016-11-17 Nan Ma , Prakash Ishwar , Piyush Gupta

We study a variant of the successive refinement problem with receiver side information where the receivers require identical reconstructions. We present general inner and outer bounds for the rate region for this variant and present a…

Information Theory · Computer Science 2016-11-18 Badri N. Vellambi , Roy Timo

We consider in-network computation of an arbitrary function over an arbitrary communication network. A network with capacity constraints on the links is given. Some nodes in the network generate data, e.g., like sensor nodes in a sensor…

Networking and Internet Architecture · Computer Science 2010-10-01 Virag Shah , Bikash Kumar Dey , D. Manjunath

For two-user interference channels, the capacity is known for the case where interference is stronger than the desired signal. Moreover, it is known that if the interference is above a certain level, it does not reduce the capacity at all.…

Information Theory · Computer Science 2012-06-21 Frederic Knabe , Aydin Sezgin

We study the problem of computing the rate-distortion function for sources with feed-forward and the capacity for channels with feedback. The formulas (involving directed information) for the optimal rate-distortion function with…

Information Theory · Computer Science 2007-07-18 Ramji Venkataramanan , S. Sandeep Pradhan

We consider a multiterminal source coding problem in which a source is estimated at a central processing unit from lossy-compressed remote observations. Each lossy-encoded observation is produced by a remote sensor which obtains a noisy…

Information Theory · Computer Science 2016-05-13 Ruiyang Song , Stefano Rini , Alon Kipnis , Andrea J. Goldsmith

We explore the role of interaction for the problem of reliable computation over two-way multicast networks. Specifically we consider a four-node network in which two nodes wish to compute a modulo-sum of two independent Bernoulli sources…

Information Theory · Computer Science 2018-10-25 Seiyun Shin , Changho Suh

A joint communication and channel state estimation problem is investigated, in which reliable information transmission over a noisy channel, and high-fidelity estimation of the channel state, are simultaneously sought. The tradeoff between…

Information Theory · Computer Science 2008-01-09 Wenyi Zhang , Satish Vedantam , Urbashi Mitra

The inversion of linear systems is a fundamental step in many inverse problems. Computational challenges exist when trying to invert large linear systems, where limited computing resources mean that only part of the system can be kept in…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-09-05 Yushan Gao , Thomas Blumensath

We consider the distributed function computation problem in asymmetric communication scenarios, where the sink computes some deterministic function of the data split among N correlated informants. The distributed function computation…

Information Theory · Computer Science 2009-07-13 Samar Agnihotri , Rajesh Venkatachalapathy

We consider the problem of lossy source coding with side information under a privacy constraint that the reconstruction sequence at a decoder should be kept secret to a certain extent from another terminal such as an eavesdropper, a sender,…

Information Theory · Computer Science 2014-06-25 Kittipong Kittichokechai , Tobias J. Oechtering , Mikael Skoglund

This paper studies a variant of the rate-distortion problem motivated by task-oriented semantic communication and distributed learning problems, where $M$ correlated sources are independently encoded for a central decoder. The decoder has…

Information Theory · Computer Science 2024-05-24 Jiancheng Tang , Qianqian Yang , Deniz Gündüz

A coding problem for correlated information sources is investigated. Messages emitted from two correlated sources are jointly encoded, and delivered to two decoders. Each decoder has access to one of the two messages to enable it to…

Information Theory · Computer Science 2008-04-11 Akisato Kimura , Tomohiko Uyematsu

Computing the rate-distortion function for continuous sources is commonly regarded as a standard continuous optimization problem. When numerically addressing this problem, a typical approach involves discretizing the source space and…

Information Theory · Computer Science 2024-05-02 Lingyi Chen , Shitong Wu , Wenyi Zhang , Huihui Wu , Hao Wu

The source-coding problem with side information at the decoder is studied subject to a constraint that the encoder---to whom the side information is unavailable---be able to compute the decoder's reconstruction sequence to within some…

Information Theory · Computer Science 2016-11-15 Amos Lapidoth , Andreas Malär , Michèle Wigger