English
Related papers

Related papers: The Dispersion of Lossy Source Coding

200 papers

Marton's optimal error exponent for the lossy source coding problem is defined as a non-convex optimization problem. This fact had prevented us to develop an efficient algorithm to compute it. This problem is caused by the fact that the…

Information Theory · Computer Science 2024-09-13 Yutaka Jitsumatsu

In this monograph, we review recent advances in second-order asymptotics for lossy source coding, which provides approximations to the finite blocklength performance of optimal codes. The monograph is divided into three parts. In part I, we…

Information Theory · Computer Science 2024-10-25 Lin Zhou , Mehul Motani

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

We consider the rate-distortion function for lossy source compression, as well as the channel capacity for error correction, through the lens of distributional robustness. We assume that the distribution of the source or of the additive…

Information Theory · Computer Science 2024-05-14 Vikrant Malik , Taylan Kargin , Victoria Kostina , Babak Hassibi

We consider lossy source coding when side information affecting the distortion measure may be available at the encoder, decoder, both, or neither. For example, such distortion side information can model reliabilities for noisy measurements,…

Information Theory · Computer Science 2014-11-17 Emin Martinian , Gregory W. Wornell , Ram Zamir

A composite source, consisting of multiple subsources and a memoryless switch, outputs one symbol at a time from the subsource selected by the switch. If some data should be encoded more accurately than other data from an information…

Information Theory · Computer Science 2024-11-14 Jiakun Liu , H. Vincent Poor , Iickho Song , Wenyi Zhang

We investigate lossy compression (source coding) of data in the form of permutations. This problem has direct applications in the storage of ordinal data or rankings, and in the analysis of sorting algorithms. We analyze the rate-distortion…

Information Theory · Computer Science 2016-11-18 Da Wang , Arya Mazumdar , Gregory Wornell

In this paper, the rate-distortion theory of the Gray-Wyner lossy source coding system is investigated. For the case of jointly Gaussian distributed sources, we establish an expression for the rate-distortion function under the constraint…

Information Theory · Computer Science 2023-03-29 Guojun Chen , Yinfei Xu , Ling Liu , Tiecheng Song , Jing Hu

Lossy transmission over a relay channel in which the relay has access to correlated side information is considered. First, a joint source-channel decode-and-forward scheme is proposed for general discrete memoryless sources and channels.…

Information Theory · Computer Science 2016-11-17 Deniz Gunduz , Elza Erkip , Andrea J. Goldsmith , H. Vincent Poor

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

Some state-of-art multimedia source encoders produce embedded source bit streams that upon the reliable reception of only a fraction of the total bit stream, the decoder is able reconstruct the source up to a basic quality. Reliable…

Multimedia · Computer Science 2014-03-04 Suayb S. Arslan

We consider lossy compression of a binary symmetric source by means of a low-density generator-matrix code. We derive two lower bounds on the rate distortion function which are valid for any low-density generator-matrix code with a given…

Information Theory · Computer Science 2008-04-11 Shrinivas Kudekar , Ruediger Urbanke

It is well known that separation between lossy source coding and channel coding is asymptotically optimal under classical additive distortion measures. Recently, coding under a new class of quality considerations, often referred to as…

Information Theory · Computer Science 2025-07-02 Chao Tian , Jun Chen , Krishna Narayanan

A transmitter without channel state information (CSI) wishes to send a delay-limited Gaussian source over a slowly fading channel. The source is coded in superimposed layers, with each layer successively refining the description in the…

Information Theory · Computer Science 2009-10-22 Chris T. K. Ng , Deniz Gunduz , Andrea Goldsmith , Elza Erkip

A scenario involving a source, a channel, and a destination, where the destination is interested in {\em both} reliably reconstructing the message transmitted by the source and estimating with a fidelity criterion the state of the channel,…

Information Theory · Computer Science 2011-08-30 Wenyi Zhang , Satish Vedantam , Urbashi Mitra

We establish a theory of quantum-to-classical rate distortion coding. In this setting, a sender Alice has many copies of a quantum information source. Her goal is to transmit classical information about the source, obtained by performing a…

Quantum Physics · Physics 2013-04-05 Nilanjana Datta , Min-Hsiu Hsieh , Mark M. Wilde , Andreas Winter

We prove achievability of the recently characterized quadratic Gaussian rate-distortion function (RDF) subject to the constraint that the distortion is uncorrelated to the source. This result is based on shaped dithered lattice quantization…

Information Theory · Computer Science 2008-07-24 Milan S. Derpich , Jan Ostergaard , Daniel E. Quevedo

The transmission of a Gaussian source over a block-fading multiple antenna channel in the presence of a feedback link is considered. The feedback link is assumed to be an error and delay free link of capacity 1 bit per channel use. Under…

Information Theory · Computer Science 2016-11-17 Deniz Gunduz , Andrea Goldsmith , H. Vincent Poor

Motivated from the fact that universal source coding on countably infinite alphabets is not feasible, this work introduces the notion of almost lossless source coding. Analog to the weak variable-length source coding problem studied by Han…

Information Theory · Computer Science 2021-11-30 Jorge F. Silva , Pablo Piantanida

We propose a source/channel duality in the exponential regime, where success/failure in source coding parallels error/correctness in channel coding, and a distortion constraint becomes a log-likelihood ratio (LLR) threshold. We establish…

Information Theory · Computer Science 2017-01-27 Sergey Tridenski , Ram Zamir
‹ Prev 1 3 4 5 6 7 10 Next ›