English
Related papers

Related papers: Minimax Rate-Distortion

200 papers

Rate distortion theory is concerned with optimally encoding a given signal class $\mathcal{S}$ using a budget of $R$ bits, as $R\to\infty$. We say that $\mathcal{S}$ can be compressed at rate $s$ if we can achieve an error of…

Functional Analysis · Mathematics 2020-08-04 Philipp Grohs , Andreas Klotz , Felix Voigtlaender

The problem of joint universal source coding and modeling, addressed by Rissanen in the context of lossless codes, is generalized to fixed-rate lossy coding of continuous-alphabet memoryless sources. We show that, for bounded distortion…

Information Theory · Computer Science 2016-11-15 Maxim Raginsky

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

The problem of variable-rate lossless data compression is considered, for codes with and without prefix constraints. Sharp bounds are derived for the best achievable compression rate of memoryless sources, when the excess-rate probability…

Information Theory · Computer Science 2025-11-13 Andreas Theocharous , Lampros Gavalakis , Ioannis Kontoyiannis

We present a new approach to convergence rate results for variational regularization. Avoiding Bregman distances and using image space approximation rates as source conditions we prove a nearly minimax theorem showing that the modulus of…

Numerical Analysis · Mathematics 2021-07-07 Philip Miller

In the successive refinement problem, a fixed-length sequence emitted from an information source is encoded into two codewords by two encoders in order to give two reconstructions of the sequence. One of two reconstructions is obtained by…

Information Theory · Computer Science 2018-12-26 Tetsunao Matsuta , Tomohiko Uyematsu

We consider channel coding for discrete memoryless channels (DMCs) with a novel cost constraint that constrains both the mean and the variance of the cost of the codewords. We show that the maximum (asymptotically) achievable rate under the…

Information Theory · Computer Science 2025-01-23 Adeel Mahmood , Aaron B. Wagner

We propose a universal ensemble for random selection of rate-distortion codes, which is asymptotically optimal in a sample-wise sense. According to this ensemble, each reproduction vector, $\hbx$, is selected independently at random under…

Information Theory · Computer Science 2022-12-26 Neri Merhav

In image compression, with recent advances in generative modeling, the existence of a trade-off between the rate and the perceptual quality (realism) has been brought to light, where the realism is measured by the closeness of the output…

Information Theory · Computer Science 2024-04-02 Yassine Hamdi , Aaron B. Wagner , Deniz Gündüz

In this paper, we present an efficiently encodable and decodable code construction that is capable of correction a burst of deletions of length at most $k$. The redundancy of this code is $\log n + k(k+1)/2\log \log n+c_k$ for some constant…

Information Theory · Computer Science 2020-01-22 Andreas Lenz , Nikita Polyanskii

Motivated by the lossy compression of an active-vision video stream, we consider the problem of finding the rate-distortion function of an arbitrarily varying source (AVS) composed of a finite number of subsources with known distributions.…

Information Theory · Computer Science 2016-09-08 Hari Palaiyanur , Cheng Chang , Anant Sahai

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

A multiple-descriptions (MD) coding strategy is proposed and an inner bound to the achievable rate-distortion region is derived. The scheme utilizes linear codes. It is shown in two different MD set-ups that the linear coding scheme…

Information Theory · Computer Science 2014-02-11 Farhad Shirani , Sandeep Pradhan

A message composed of packets is transmitted using erasure and channel coding over a fading channel with no feedback. For this scenario, the paper explores the trade-off between the redundancies allocated to the packet-level erasure code…

Information Theory · Computer Science 2016-02-03 Sudarsan V. S. Ranganathan , Tong Mu , Richard D. Wesel

We show that the maximum expected inner product between a random vector and the standard normal vector over all couplings subject to a mutual information constraint or regularization is equivalent to a truncated integral involving the…

Information Theory · Computer Science 2026-04-16 Jingbo Liu

Since Shannon's foundational work, rate-distortion theory has defined the fundamental limits of lossy compression. Classical results, derived for memoryless and stationary ergodic sources in the asymptotic regime, have shaped both transform…

Information Theory · Computer Science 2026-03-11 Sujata Sinha , Vishwas Rao , Robert Underwood , David Lenz , Sheng Di , Franck Cappello , Lingjia Liu

The order of letters is not always relevant in a communication task. This paper discusses the implications of order irrelevance on source coding, presenting results in several major branches of source coding theory: lossless coding,…

Information Theory · Computer Science 2007-08-20 Lav R. Varshney , Vivek K. Goyal

We consider the rate distortion problem with side information at the decoder posed and investigated by Wyner and Ziv. The rate distortion function indicating the trade-off between the rate on the data compression and the quality of data…

Information Theory · Computer Science 2016-04-27 Yasutada Oohama

Variational principles for the rate distortion (RD) theory in lossy compression are formulated within the ambit of the generalized nonextensive statistics of Tsallis, for values of the nonextensivity parameter satisfying $ 0 < q < 1 $ and $…

Statistical Mechanics · Physics 2009-02-10 R. C. Venkatesan , A. Plastino

An information-spectrum approach is applied to solve the multiterminal source coding problem for correlated general sources, where sources may be nonstationary and/or nonergodic, and the distortion measure is arbitrary and may be…

Information Theory · Computer Science 2007-07-13 Shengtian Yang , Peiliang Qiu
‹ Prev 1 3 4 5 6 7 10 Next ›