English
Related papers

Related papers: Rate-Distortion Bounds for an Epsilon-Insensitive …

200 papers

The Shannon lower bound is one of the few lower bounds on the rate-distortion function that holds for a large class of sources. In this paper, it is demonstrated that its gap to the rate-distortion function vanishes as the allowed…

Information Theory · Computer Science 2016-11-17 Tobias Koch

We derive a lower bound on the differential entropy of a log-concave random variable $X$ in terms of the $p$-th absolute moment of $X$. The new bound leads to a reverse entropy power inequality with an explicit constant, and to new bounds…

Information Theory · Computer Science 2018-04-04 Arnaud Marsiglietti , Victoria Kostina

This paper considers lossy source coding of $n$-dimensional memoryless sources and shows an explicit approximation to the minimum source coding rate required to sustain the probability of exceeding distortion $d$ no greater than $\epsilon$,…

Information Theory · Computer Science 2017-02-28 Victoria Kostina

Rate-distortion-perception theory generalizes Shannon's rate-distortion theory by introducing a constraint on the perceptual quality of the output. The perception constraint complements the conventional distortion constraint and aims to…

Information Theory · Computer Science 2022-04-14 Jun Chen , Lei Yu , Jia Wang , Wuxian Shi , Yiqun Ge , Wen Tong

Lossy data compression lies at the heart of modern communication and storage systems. Shannon's rate-distortion theory provides the fundamental limit on how much a source can be compressed at a given fidelity, but it assumes infinitely long…

Information Theory · Computer Science 2026-03-10 Bhaskar Krishnamachari

We derive a simple general parametric representation of the rate-distortion function of a memoryless source, where both the rate and the distortion are given by integrals whose integrands include the minimum mean square error (MMSE) of the…

Information Theory · Computer Science 2010-04-30 Neri Merhav

This paper is concerned with a rate-distortion theory for sequences of i.i.d. random variables with general distribution supported on general sets including manifolds and fractal sets. Manifold structures are prevalent in data science,…

Information Theory · Computer Science 2018-04-25 Erwin Riegler , Günther Koliander , Helmut Bölcskei

Motivated by questions in lossy data compression and by theoretical considerations, we examine the problem of estimating the rate-distortion function of an unknown (not necessarily discrete-valued) source from empirical data. Our focus is…

Information Theory · Computer Science 2013-01-18 M. T. Harrison , I. Kontoyiannis

New bounds on the rate distortion function of certain non-Gaussian sources, with a proportional-weighted mean-square error (MSE) distortion measure, are given. The growth, g, of the rate distortion function, as a result of changing from a…

Information Theory · Computer Science 2007-07-13 Jacob Binia

We characterize the rate-distortion function for zero-mean stationary Gaussian sources under the MSE fidelity criterion and subject to the additional constraint that the distortion is uncorrelated to the input. The solution is given by two…

Information Theory · Computer Science 2008-01-14 Milan S. Derpich , Jan Ostergaard , Graham C. Goodwin

This paper studies the performance of sparse regression codes for lossy compression with the squared-error distortion criterion. In a sparse regression code, codewords are linear combinations of subsets of columns of a design matrix. It is…

Information Theory · Computer Science 2017-07-17 Ramji Venkataramanan , Sekhar Tatikonda

Consider the problem of estimating a latent signal from a lossy compressed version of the data when the compressor is agnostic to the relation between the signal and the data. This situation arises in a host of modern applications when data…

Information Theory · Computer Science 2021-01-12 Alon Kipnis , Stefano Rini , Andrea J. Goldsmith

Shannon's rate-distortion theory treats source symbols as unstructured labels. When the source is a knowledge base equipped with a logical proof system, a natural fidelity criterion is closure fidelity: a reconstruction is acceptable if it…

Information Theory · Computer Science 2026-04-14 Jianfeng Xu

We consider a Shannon cipher system for memoryless sources, in which distortion is allowed at the legitimate decoder. The source is compressed using a rate distortion code secured by a shared key, which satisfies a constraint on the…

Information Theory · Computer Science 2016-11-17 Nir Weinberger , Neri Merhav

We improve the existing achievable rate regions for causal and for zero-delay source coding of stationary Gaussian sources under an average mean squared error (MSE) distortion measure. To begin with, we find a closed-form expression for the…

Information Theory · Computer Science 2011-05-03 Milan S. Derpich , Jan Østergaard

Shannon proved that if we can transmit bits reliably at rates larger than the rate distortion function $R(D)$, then we can transmit this source to within a distortion $D$. We answer the converse question ``If we can transmit a source to…

Information Theory · Computer Science 2007-07-13 Mukul Agarwal , Anant Sahai , Sanjoy Mitter

We derive quantum counterparts of two key theorems of classical information theory, namely, the rate distortion theorem and the source-channel separation theorem. The rate-distortion theorem gives the ultimate limits on lossy data…

Quantum Physics · Physics 2012-12-21 Nilanjana Datta , Min-Hsiu Hsieh , Mark M. Wilde

A new source model, which consists of an intrinsic state part and an extrinsic observation part, is proposed and its information-theoretic characterization, namely its rate-distortion function, is defined and analyzed. Such a source model…

Information Theory · Computer Science 2022-06-02 Jiakun Liu , Shuo Shao , Wenyi Zhang , H. Vincent Poor

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

In this paper, we study the rate distortion function of the i.i.d sequence of multiplications of a Bernoulli $p$ random variable and a gaussian random variable $\sim N(0,1)$. We use a new technique in the derivation of the lower bound in…

Information Theory · Computer Science 2016-11-15 Cheng Chang
‹ Prev 1 2 3 10 Next ›