English
Related papers

Related papers: Minimum Expected Distortion in Gaussian Source Cod…

200 papers

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

We investigate the problem of strategic point-to-point communication with side information at the decoder, in which the encoder and the decoder have mismatched distortion functions. The decoding process is not supervised, it returns the…

Information Theory · Computer Science 2020-09-18 Maël Le Treust , Tristan Tomala

The problem of lossless fixed-rate streaming coding of discrete memoryless sources with side information at the decoder is studied. A random time-varying tree-code is used to sequentially bin strings and a Stack Algorithm with a variable…

Information Theory · Computer Science 2007-07-13 Hari Palaiyanur , Anant Sahai

We provide a complete characterization of the achievable distortion region for the problem of sending a bivariate Gaussian source over bandwidth-matched Gaussian broadcast channels, where each receiver is interested in only one component of…

Information Theory · Computer Science 2010-06-04 Chao Tian , Suhas Diggavi , Shlomo Shamai

We consider the problem of estimating a Gaussian random walk from a lossy compression of its decimated version. Hence, the encoder operates on the decimated random walk, and the decoder estimates the original random walk from its encoded…

Signal Processing · Electrical Eng. & Systems 2018-02-28 Georgia Murray , Alon Kipnis , Andrea J. Goldsmith

We consider the classic joint source-channel coding problem of transmitting a memoryless source over a memoryless channel. The focus of this work is on the long-standing open problem of finding the rate of convergence of the smallest…

Information Theory · Computer Science 2019-08-27 Yuval Kochman , Or Ordentlich , Yury Polyanskiy

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 investigate the upper and lower bounds on the quantization distortions for independent and identically distributed sources in the finite block-length regime. Based on the convex optimization framework of the rate-distortion theory, we…

Information Theory · Computer Science 2013-06-21 Chen Gong , Xiaodong Wang

An analog source is to be transmitted across a Gaussian channel in more than one channel use per source symbol. This paper derives a lower bound on the asymptotic mean squared error for a strategy that consists of repeatedly quantizing the…

Information Theory · Computer Science 2016-11-17 Marius Kleiner , Bixio Rimoldi

This paper considers the problem of lossy compression for the computation of a function of two correlated sources, both of which are observed at the encoder. Due to presence of observation costs, the encoder is allowed to observe only…

Information Theory · Computer Science 2013-07-22 Xi Liu , Osvaldo Simeone , Elza Erkip

Rate distortion theory treats the problem of encoding a source with minimum codebook size while at the same time allowing for a certain amount of errors in the reconstruction measured by a fidelity criterion and distortion level. Similar to…

Information Theory · Computer Science 2025-11-13 Jonathan E. W. Huffmann , Holger Boche

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

We study strategic Gaussian semantic compression under rate and compute constraints, where an encoder and decoder optimize distinct quadratic objectives. A latent Gaussian state generates a task dependent semantic variable, and the decoder…

Information Theory · Computer Science 2026-02-05 Emrah Akyol

Many information systems employ lossy compression as a crucial intermediate stage among other processing components. While the important distortion is defined by the system's input and output signals, the compression usually ignores the…

Information Theory · Computer Science 2018-05-14 Yehuda Dar , Michael Elad , Alfred M. Bruckstein

Lossy coding of correlated sources over a multiple access channel (MAC) is studied. First, a joint source-channel coding scheme is presented when the decoder has correlated side information. Next, the optimality of separate source and…

Information Theory · Computer Science 2018-06-18 Basak Guler , Deniz Gunduz , Aylin Yener

This paper considers the source coding problem with broadcast side information. The side information is sent to two receivers through a noisy broadcast channel. We provide an outer bound of the rate--distortion--bandwidth (RDB) quadruples…

Information Theory · Computer Science 2026-02-19 Yiqi Chen , Holger Boche , Marc Geitz

We provide a framework for one-shot quantum rate distortion coding, in which the goal is to determine the minimum number of qubits required to compress quantum information as a function of the probability that the distortion incurred upon…

Quantum Physics · Physics 2013-12-09 Nilanjana Datta , Joseph M. Renes , Renato Renner , Mark M. Wilde

This paper investigates delay-distortion-power trade offs in transmission of quasi-stationary sources over block fading channels by studying encoder and decoder buffering techniques to smooth out the source and channel variations. Four…

Information Theory · Computer Science 2015-05-05 Roghayeh Joda , Farshad Lahouti , Elza Erkip

As shown by M\'edard, the capacity of fading channels with imperfect channel-state information (CSI) can be lower-bounded by assuming a Gaussian channel input $X$ with power $P$ and by upper-bounding the conditional entropy $h(X|Y,\hat{H})$…

Information Theory · Computer Science 2016-11-15 Adriano Pastore , Tobias Koch , Javier Rodríguez Fonollosa

Consider the problem where a statistician in a two-node system receives rate-limited information from a transmitter about marginal observations of a memoryless process generated from two possible distributions. Using its own observations,…

Information Theory · Computer Science 2017-03-02 Gil Katz , Pablo Piantanida , Mérouane Debbah