English
Related papers

Related papers: A note on the sum-rate-distortion function of some…

200 papers

An alternative approach to two-part 'critical compression' is presented. Whereas previous results were based on summing a lossless code at reduced precision with a lossy-compressed error or noise term, the present approach uses a similar…

Multimedia · Computer Science 2013-01-03 John Scoville

Past works on remote lossy source coding studied the rate under average distortion and the error exponent of excess distortion probability. In this work, we look into how fast the excess distortion probability converges to 1 at small rates,…

Information Theory · Computer Science 2025-04-24 Han Wu , Hamdi Joudeh

In this paper, we investigate the problem of distributionally robust source coding, i.e., source coding under uncertainty in the source distribution, discussing both the coding and computational aspects of the problem. We propose two…

Information Theory · Computer Science 2025-07-24 Giuseppe Serra , Photios A. Stavrou , Marios Kountouris

The unfolding problem formulation for correcting experimental data distortions due to finite resolution and limited detector acceptance is discussed. A novel validation of the problem solution is proposed. Attention is drawn to fact that…

Data Analysis, Statistics and Probability · Physics 2016-04-08 Nikolai Gagunashvili

A causal rate distortion function is defined, its solution is described, and its relation to filtering theory is discussed. The relation to filtering is obtained via a causal constraint imposed on the reconstruction kernel to be realizable.

Information Theory · Computer Science 2012-06-07 Photios A. Stavrou , Charalambos D. Charalambous

Algorithms based on multiple decoding attempts of Reed-Solomon (RS) codes have recently attracted new attention. Choosing decoding candidates based on rate-distortion (R-D) theory, as proposed previously by the authors, currently provides…

Information Theory · Computer Science 2016-11-17 Phong S. Nguyen , Henry D. Pfister , Krishna R. Narayanan

Consider a generalized multiterminal source coding system, where $\ell\choose m$ encoders, each observing a distinct size-$m$ subset of $\ell$ ($\ell\geq 2$) zero-mean unit-variance symmetrically correlated Gaussian sources with correlation…

Information Theory · Computer Science 2017-10-16 Jun Chen , Li Xie , Yameng Chang , Jia Wang , Yizhong Wang

We consider correlated and distributed sources without cooperation at the encoder. For these sources, we derive the best achievable performance in the rate-distortion sense of any distributed compressed sensing scheme, under the constraint…

Information Theory · Computer Science 2014-04-10 Giulio Coluccia , Aline Roumy , Enrico Magli

Recently, a number of authors have proposed decoding schemes for Reed-Solomon (RS) codes based on multiple trials of a simple RS decoding algorithm. In this paper, we present a rate-distortion (R-D) approach to analyze these…

Information Theory · Computer Science 2009-08-21 Phong S. Nguyen , Henry D. Pfister , Krishna R. Narayanan

We consider a distributed source coding problem of $L$ correlated Gaussian observations $Y_i, i=1,2,...,L$. We assume that the random vector $Y^{L}={}^{\rm t} (Y_1,Y_2,$ $...,Y_L)$ is an observation of the Gaussian random vector…

Information Theory · Computer Science 2010-01-13 Yasutada Oohama

A Causal rate distortion function with a general fidelity criterion is formulated on abstract alphabets and the optimal reconstruction kernel is derived, which consists of a product of causal kernels. In the process, general abstract spaces…

Information Theory · Computer Science 2011-02-17 Charalambos D. Charalambous , Photios A. Stavrou , Christos K. Kourtellaris

Classical rate-distortion theory requires knowledge of an elusive source distribution. Instead, we analyze rate-distortion properties of individual objects using the recently developed algorithmic rate-distortion theory. The latter is based…

Information Theory · Computer Science 2007-07-16 Steven de Rooij , Paul Vitanyi

An enhanced covering lemma for a Markov chain is proved in this paper, and then the distributed source coding problem of correlated general sources with one average distortion criterion under fixed-length coding is investigated. Based on…

Information Theory · Computer Science 2016-11-17 Shengtian Yang , Peiliang Qiu

We consider a rate-distortion version of the quantum state redistribution task, where the error of the decoded state is judged via an additive distortion measure; it thus constitutes a quantum generalisation of the classical Wyner-Ziv…

Quantum Physics · Physics 2025-04-11 Zahra Baghali Khanian , Andreas Winter

We consider the problem of coding for computing with maximal distortion, where the sender communicates with a receiver, which has its own private data and wants to compute a function of their combined data with some fidelity constraint…

Information Theory · Computer Science 2019-10-21 Sourya Basu , Daewon Seo , Lav R. Varshney

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

In this paper, we consider the information-theoretic characterization of the set of achievable rates and distortions in a broad class of multiterminal communication scenarios with general continuous-valued sources and channels. A framework…

Information Theory · Computer Science 2022-02-24 Farhad Shirani , S. Sandeep Pradhan

Consider the two-way rate-distortion problem in which a helper sends a common limited-rate message to both users based on side information at its disposal. We characterize the region of achievable rates and distortions where a Markov form…

Information Theory · Computer Science 2009-04-06 Haim Permuter , Yossi Steinberg , Tsachy Weissman

We study the moderate-deviations (MD) setting for lossy source coding of stationary memoryless sources. More specifically, we derive fundamental compression limits of source codes whose rates are $R(D) \pm \epsilon_n$, where $R(D)$ is the…

Information Theory · Computer Science 2012-05-11 Vincent Y. F. Tan

A likelihood encoder is studied in the context of lossy source compression. The analysis of the likelihood encoder is based on the soft-covering lemma. It is demonstrated that the use of a likelihood encoder together with the soft-covering…

Information Theory · Computer Science 2016-04-07 Eva C. Song , Paul Cuff , H. Vincent Poor