English
Related papers

Related papers: Generalized Gaussian Multiterminal Source Coding i…

200 papers

This paper investigates two-terminal interactive function computation with reconstruction constraints. Each terminal wants to compute a (possibly different) function of two correlated sources, but can only access one of the sources…

Information Theory · Computer Science 2013-10-10 Farideh Ebrahim Rezagah , Elza Erkip

We consider a problem of coding for computing, where the decoder wishes to estimate a function of its local message and the source message at the encoder within a given distortion. We show that the rate-distortion function can be…

Information Theory · Computer Science 2022-05-18 Deheng Yuan , Tao Guo , Bo Bai , Wei Han

We consider the k-encoder source coding problem with a quadratic distortion measure. We show that among all source distributions with a given covariance matrix K, the jointly Gaussian source requires the highest rates in order to meet a…

Information Theory · Computer Science 2016-11-15 Ilan Shomorony , A. Salman Avestimehr , Himanshu Asnani , Tsachy Weissman

In this paper, we propose a lattice-based robust distributed source coding system for two correlated sources and provide a detailed performance analysis under the high resolution assumption. It is shown, among other things, that, in the…

Information Theory · Computer Science 2018-10-04 Dania Elzouki , Sorina Dumitrescu , Jun Chen

Through refined asymptotic analysis based on the normal approximation, we study how higher-order coding performance depends on the mean power as well as on finer statistics of the input power. We introduce a multifaceted power model in…

Information Theory · Computer Science 2026-05-13 Adeel Mahmood , Aaron B. Wagner

Quantum random variable, distortion operator are introduced based on canonical operators. As the lower bound of rate distortion, the entanglement information rate distortion is achieved by Gaussian map for Gaussian source. General Gaussian…

Quantum Physics · Physics 2007-05-23 Xiao-yu Chen

In this paper we study the nonasymptotic bounds of a special Joint Source-Channel Coding system with hierarchical source, where an observable source and an unobservable indirect source are required to be reconstructed. Namely, we focus on…

Information Theory · Computer Science 2026-03-17 Shuo Shao , Chao Qi , Jincheng Dai

We consider the problem of causal source coding and causal decoding of a Gauss--Markov source, where the decoder has causal access to a side-information signal. We define the information causal rate-distortion function with causal decoder…

Information Theory · Computer Science 2020-08-13 Omri Lev , Anatoly Khina

We consider the problem of transmission of several distributed correlated sources over a multiple access channel (MAC) with side information at the sources and the decoder. Source-channel separation does not hold for this channel.…

Information Theory · Computer Science 2016-11-15 R. Rajesh , Vinod Sharma , V. K. Varshenya

We study the rate-distortion problem for both scalar and vector memoryless heavy-tailed $\alpha$-stable sources ($0 < \alpha < 2$). Using a recently defined notion of ``strength" as a power measure, we derive the rate-distortion function…

Information Theory · Computer Science 2026-02-27 Karim Ezzeddine , Jihad Fahs , Ibrahim Abou-Faycal

A multiterminal lossy coding problem, which includes various problems such as the Wyner-Ziv problem and the complementary delivery problem as special cases, is considered. It is shown that any point in the achievable rate-distortion region…

Information Theory · Computer Science 2010-04-20 Shigeaki Kuzuoka , Akisato Kimura , Tomohiko Uyematsu

This paper shows new general nonasymptotic achievability and converse bounds and performs their dispersion analysis for the lossy compression problem in which the compressor observes the source through a noisy channel. While this problem is…

Information Theory · Computer Science 2016-09-19 Victoria Kostina , Sergio Verdú

Consider a Gaussian memoryless multiple source with $m$ components with joint probability distribution known only to lie in a given class of distributions. A subset of $k \leq m$ components are sampled and compressed with the objective of…

Information Theory · Computer Science 2018-03-16 Vinay Praneeth Boda

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

In this paper, we consider the problem of remote vector Gaussian source coding for a wireless acoustic sensor network. Each node receives messages from multiple nodes in the network and decodes these messages using its own measurement of…

Information Theory · Computer Science 2016-11-15 Adel Zahedi , Jan Ostergaard , Soren Holdt Jensen , Patrick Naylor , Soren Bech

This paper deals with rate distortion or source coding with fidelity criterion, in measure spaces, for a class of source distributions. The class of source distributions is described by a relative entropy constraint set between the true and…

Information Theory · Computer Science 2013-05-07 Farzad Rezaei , Charalambos D. Charalambous , Photios A. Stavrou

This paper investigates a unification of distributed source coding, multiple description coding, and source coding with side information at decoders. The equivalence between the multiple-decoder extension of distributed source coding with…

Information Theory · Computer Science 2024-10-28 Jun Muramatsu

We consider the problem of distributed joint source-channel coding of correlated Gaussian sources over a Gaussian Multiple Access Channel (GMAC). There may be side information at the decoder and/or at the encoders. First we specialize a…

Information Theory · Computer Science 2009-05-15 R Rajesh , Vinod Sharma

Consider a pair of correlated Gaussian sources (X1,X2). Two separate encoders observe the two components and communicate compressed versions of their observations to a common decoder. The decoder is interested in reconstructing a linear…

Information Theory · Computer Science 2007-07-25 D. Krithivasan , S. S. Pradhan

The rate-distortion saddle-point problem considered by Lapidoth (1997) consists in finding the minimum rate to compress an arbitrary ergodic source when one is constrained to use a random Gaussian codebook and minimum (Euclidean) distance…

Information Theory · Computer Science 2018-09-03 Lin Zhou , Vincent Y. F. Tan , Mehul Motani