English
Related papers

Related papers: An Upper Bound to Zero-Delay Rate Distortion via K…

200 papers

Consider a pair of correlated Gaussian sources (X1,X2). Two separate encoders observe the two components and communicate compressed versions of their observations to a common decoder. The decoder is interested in reconstructing a linear…

Information Theory · Computer Science 2007-07-25 D. Krithivasan , S. S. Pradhan

We present nonasymptotic achievability and converse bounds on the maximum coding rate (for a fixed average error probability and a fixed average blocklength) of variable-length full-feedback (VLF) and variable-length stop-feedback (VLSF)…

Information Theory · Computer Science 2016-07-26 Rahul Devassy , Giuseppe Durisi , Benjamin Lindqvist , Wei Yang , Marco Dalai

We show the existence of variable-rate rate-distortion codes that meet the disortion constraint almost surely and are minimax, i.e., strongly, universal with respect to an unknown source distribution and a distortion measure that is…

Information Theory · Computer Science 2022-11-29 Adeel Mahmood , Aaron B. Wagner

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

We present a novel systematic theoretical framework to analyze the rate-distortion (R-D) limits of learned image compression. While recent neural codecs have achieved remarkable empirical results, their distance from the…

Information Theory · Computer Science 2026-01-15 Changshuo Wang , Zijian Liang , Kai Niu , Ping Zhang

In this paper, communication of a Multivariate Gaussian over a Gaussian Multiple Access Channel is studied. Distributed zero-delay joint source-channel coding (JSCC) solutions to the problem are given. Both nonlinear and linear approaches…

Information Theory · Computer Science 2014-01-14 Pål Anders Floor , Anna N. Kim , Tor A. Ramstad , Ilangko Balasingham , Niklas Wernersson , Mikael Skoglund

A general expression for the distortion rate function (DRF) of cyclostationary Gaussian processes in terms of their spectral properties is derived. This expression can be seen as the result of orthogonalization over the different components…

Information Theory · Computer Science 2016-08-11 Alon Kipnis , Andrea J. Goldsmith , Yonina C. Eldar

In this paper the relation between nonanticipative rate distortion function (RDF) and Bayesian filtering theory is investigated using the topology of weak convergence of probability measures on Polish spaces. The relation is established via…

Information Theory · Computer Science 2013-04-29 Charalambos D. Charalambous , Photios A. Stavrou

Motivated by the practical constraints arising in emerging sensor network and Internet-of-Things (IoT) applications, the zero-delay transmission of a Gaussian measurement over a real single-input multiple-output (SIMO) additive white…

Information Theory · Computer Science 2017-06-01 Morteza Varasteh , Borzoo Rassouli , Osvaldo Simeone , Deniz Gunduz

For a Gaussian source under mean-squared error (MSE), classical transform coding is rate--distortion (RD) optimal: the Karhunen--Loeve transform (KLT) diagonalizes the covariance, reverse waterfilling allocates the bits, and scalar…

Information Theory · Computer Science 2026-05-18 Bumsu Park , Chanho Park , Youngmok Park , Namyoon Lee

We consider the remote vector source coding problem in which a vector Gaussian source is to be estimated from noisy linear measurements. For this problem, we derive the performance of the compress-and-estimate (CE) coding scheme and compare…

Information Theory · Computer Science 2017-07-04 Ruiyang Song , Stefano Rini , Alon Kipnis , Andrea Goldsmith

We investigate the optimal performance of dense sensor networks by studying the joint source-channel coding problem. The overall goal of the sensor network is to take measurements from an underlying random process, code and transmit those…

Information Theory · Computer Science 2007-07-13 Nan Liu , Sennur Ulukus

This paper investigates the problem of variable-length lossy source coding allowing a positive excess distortion probability and an overflow probability of codeword lengths. Novel one-shot achievability and converse bounds of the optimal…

Information Theory · Computer Science 2018-12-17 Shota Saito , Hideki Yagi , Toshiyasu Matsushima

Motivated by video coding applications, the problem of sequential coding of correlated sources with encoding and/or decoding frame-delays is studied. The fundamental tradeoffs between individual frame rates, individual frame distortions,…

Information Theory · Computer Science 2008-09-30 Nan Ma , Ye Wang , Prakash Ishwar

We investigate whether uncoded schemes are optimal for Gaussian sources on multiuser Gaussian channels. Particularly, we consider two problems: the first is to send correlated Gaussian sources on a Gaussian broadcast channel where each…

Information Theory · Computer Science 2017-03-02 Chao Tian , Jun Chen , Suhas Diggavi , Shlomo Shamai

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

We consider transmission of a continuous amplitude source over an L-block Rayleigh fading $M_t \times M_r$ MIMO channel when the channel state information is only available at the receiver. Since the channel is not ergodic, Shannon's…

Information Theory · Computer Science 2007-11-09 Deniz Gunduz , Elza Erkip

In this paper, we establish the connections of the fundamental limitations in feedback communication, estimation, and feedback control over Gaussian channels, from a unifying perspective for information, estimation, and control. The optimal…

Information Theory · Computer Science 2009-10-05 Jialing Liu , Nicola Elia

We study lossy compression of a finite statement source generated in a fixed deductive environment. The source symbols are statements in a knowledge base endowed with a shared proof system, and reconstruction fidelity is measured by…

Information Theory · Computer Science 2026-05-29 Jianfeng Xu

Optical networks are vulnerable to physical layer attacks; wiretappers can improperly receive messages intended for legitimate recipients. Our work considers an aspect of this security problem within the domain of multimode fiber (MMF)…

Cryptography and Security · Computer Science 2016-11-17 Eva C. Song , Emina Soljanin , Paul Cuff , H. Vincent Poor , Kyle Guan