English
Related papers

Related papers: Joint source-channel coding with feedback

200 papers

The effect of "good", point-to-point capacity achieving, code sequences on an additional signal, of bounded variance, transmitted over the additive Gaussian noise channel is examined. For such code sequences, it is shown that their effect,…

Information Theory · Computer Science 2018-04-18 Ronit Bustin , H. Vincent Poor , Shlomo Shamai

Jointly Gaussian memoryless sources are observed at N distinct terminals. The goal is to efficiently encode the observations in a distributed fashion so as to enable reconstruction of any one of the observations, say the first one, at the…

Information Theory · Computer Science 2008-05-14 Saurabha Tavildar , Pramod Viswanath , Aaron B. Wagner

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

The problem of distributed testing against independence with variable-length coding is considered when the \emph{average} and not the \emph{maximum} communication load is constrained as in previous works. The paper characterizes the optimum…

Information Theory · Computer Science 2020-05-19 Sadaf Salehkalaibar , Michele Wigger

This paper considers the problem of variable-length lossy source coding. The performance criteria are the excess distortion probability and the cumulant generating function of codeword lengths. We derive a non-asymptotic fundamental limit…

Information Theory · Computer Science 2023-12-29 Shota Saito , Toshiyasu Matsushima

The traditional information theoretic approach to studying feedback is to consider ideal instantaneous high-rate feedback of the channel outputs to the encoder. This was acceptable in classical work because the results were negative:…

Information Theory · Computer Science 2007-12-07 Anant Sahai

This paper considers a degraded Gaussian broadcast channel over which Gaussian sources are to be communicated. When the sources are independent, this paper shows that hybrid coding achieves the optimal distortion region, the same as that of…

Information Theory · Computer Science 2009-06-16 Rajiv Soundararajan , Sriram Vishwanath

The reliability function of a channel is the maximum achievable exponential rate of decay of the error probability as a function of the transmission rate. In this work, we derive bounds on the reliability function of discrete memoryless…

Information Theory · Computer Science 2023-06-13 Mohsen Heidari , Achilleas Anastasopoulos , S. Sandeep Pradhan

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

Consider a lossy compression system with $\ell$ distributed encoders and a centralized decoder. Each encoder compresses its observed source and forwards the compressed data to the decoder for joint reconstruction of the target signals under…

Information Theory · Computer Science 2018-07-19 Yizhong Wang , Li Xie , Xuan Zhang , Jun Chen

Classically, communication systems are designed assuming perfect channel state information at the receiver and/or transmitter. However, in many practical situations, only an estimate of the channel is available that differs from the true…

Information Theory · Computer Science 2007-07-13 Pablo Piantanida , Gerald Matz , Pierre Duhamel

We consider a basic communication and sensing setup comprising a transmitter, a receiver and a sensor. The transmitter sends an encoded sequence to the receiver through a discrete memoryless channel, and the receiver is interested in…

Information Theory · Computer Science 2022-05-11 Han Wu , Hamdi Joudeh

We consider the discrete memoryless degraded broadcast channels with feedback. We prove that the error probability of decoding tends to one exponentially for rates outside the capacity region and derive an explicit lower bound of this…

Information Theory · Computer Science 2015-04-24 Yasutada Oohama

Blau and Michaeli recently introduced a novel concept for inverse problems of signal processing, that is, the perception-distortion tradeoff. We introduce their tradeoff into the rate distortion theory of variable-length lossy source coding…

Information Theory · Computer Science 2019-02-12 Ryutaroh Matsumoto

In this paper, we consider some long-standing problems in communication systems with access to noisy feedback. We introduce a new notion, the residual directed information, to capture the effective information flow (i.e. mutual information…

Information Theory · Computer Science 2015-03-19 Chong Li , Nicola Elia

Variable-length compression without prefix-free constraints and with side-information available at both encoder and decoder is considered. Instead of requiring the code to be error-free, we allow for it to have a non-vanishing error…

Information Theory · Computer Science 2020-08-24 Yuta Sakai , Vincent Y. F. Tan

In this paper, we consider the mismatched rate-distortion problem, in which the encoding is done using a codebook, and the encoder chooses the minimum-distortion codeword according to a mismatched distortion function that differs from the…

Information Theory · Computer Science 2022-12-20 Millen Kanabar , Jonathan Scarlett

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

This paper studies a Shannon-theoretic version of the generalized distribution preserving quantization problem where a stationary and memoryless source is encoded subject to a distortion constraint and the additional requirement that the…

Information Theory · Computer Science 2015-07-10 Naci Saldi , Tamás Linder , Serdar Yüksel

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