English
Related papers

Related papers: Conditional Rate-Distortion-Perception Trade-Off

200 papers

In this work, we take the initiative in studying the information-theoretic tradeoff between communication and quickest change detection (QCD) under an integrated sensing and communication setting. We formally establish a joint communication…

Information Theory · Computer Science 2024-10-11 Daewon Seo , Sung Hoon Lim

The task of jointly communicating a message and reconstructing a common estimate of the channel state is examined for a fading Gaussian model with additive state interference. The state is an independent and identically distributed Gaussian…

Information Theory · Computer Science 2026-01-07 Viswanathan Ramachandran

For memoryless sources, delayed side information at the decoder does not improve the rate-distortion function. However, this is not the case for more general sources with memory, as demonstrated by a number of works focusing on the special…

Information Theory · Computer Science 2012-07-19 Osvaldo Simeone , Haim H. Permuter

This paper presents a distributed communication model to investigate multistable perception, where a stimulus gives rise to multiple competing perceptual interpretations. We formalize stable perception as consensus achieved through…

Computer Science and Game Theory · Computer Science 2023-10-19 Yuqing Kong

We show that for product sources, rate splitting is optimal for secret key agreement using limited one-way communication between two terminals. This yields an alternative information-theoretic-converse-style proof of the tensorization…

Information Theory · Computer Science 2016-04-26 Jingbo Liu , Paul Cuff , Sergio Verdú

Classical information theory typically assumes reliable receiver-side processing. We study remote inference when communication is noisy and the receiver itself is built from unreliable components under a finite redundancy budget. Under a…

Information Theory · Computer Science 2026-04-22 Zhenyu Liu , Yi Ma , Rahim Tafazolli

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

The problem of estimating the information rate distortion perception function (RDPF), which is a relevant information-theoretic quantity in goal-oriented lossy compression and semantic information reconstruction, is investigated here.…

Information Theory · Computer Science 2025-09-25 Martha V. Sourla , Giuseppe Serra , Photios A. Stavrou , Marios Kountouris

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

We consider a novel variant of $d$-semifaithful lossy coding in which the distortion measure is revealed only to the encoder and only at run-time, as well as an extension of it in which the distortion constraint $d$ is also revealed at…

Information Theory · Computer Science 2022-10-05 Adeel Mahmood , Aaron B. Wagner

In this work, we establish a full single-letter characterization of the rate-distortion region of an instance of the Gray-Wyner model with side information at the decoders. Specifically, in this model an encoder observes a pair of…

Information Theory · Computer Science 2018-02-14 Meryem Benammar , Abdellatif Zaidi

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

A joint communication and channel state estimation problem is investigated, in which reliable information transmission over a noisy channel, and high-fidelity estimation of the channel state, are simultaneously sought. The tradeoff between…

Information Theory · Computer Science 2008-01-09 Wenyi Zhang , Satish Vedantam , Urbashi Mitra

Consider a control problem with a communication channel connecting the observer of a linear stochastic system to the controller. The goal of the controller is to minimize a quadratic cost function in the state variables and control signal,…

Information Theory · Computer Science 2018-11-27 Victoria Kostina , Babak Hassibi

Finite abstractions are discrete approximations of dynamical systems, such that the set of abstraction trajectories contains all system trajectories. There is a consensus that abstractions suffer from the curse of dimensionality: for the…

Systems and Control · Electrical Eng. & Systems 2025-12-09 Giannis Delimpaltadakis , Gabriel Gleizer

We consider finite blocklength lossy compression of information sources whose components are independent but non-identically distributed. Crucially, Gaussian sources with memory and quadratic distortion can be cast in this form. We show…

Information Theory · Computer Science 2026-02-11 Eyyup Tasci , Victoria Kostina

We formulate a model for intermittent communication that can capture bursty transmissions or a sporadically available channel, where in either case the receiver does not know a priori when the transmissions will occur. Focusing on the…

Information Theory · Computer Science 2017-03-20 Mostafa Khoshnevisan , J Nicholas Laneman

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

We present a new inner bound for the rate region of the $t$-stage successive-refinement problem with side-information. We also present a new upper bound for the rate-distortion function for lossy-source coding with multiple decoders and…

Information Theory · Computer Science 2016-11-17 Roy Timo , Terence Chan , Alexander Grant

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
‹ Prev 1 8 9 10 Next ›