English
Related papers

Related papers: Indirect Rate Distortion Functions with $f$-Separa…

200 papers

Computing the rate-distortion function for continuous sources is commonly regarded as a standard continuous optimization problem. When numerically addressing this problem, a typical approach involves discretizing the source space and…

Information Theory · Computer Science 2024-05-02 Lingyi Chen , Shitong Wu , Wenyi Zhang , Huihui Wu , Hao Wu

We consider the problem of coding for computing with maximal distortion, where the sender communicates with a receiver, which has its own private data and wants to compute a function of their combined data with some fidelity constraint…

Information Theory · Computer Science 2019-10-21 Sourya Basu , Daewon Seo , Lav R. Varshney

This paper is concerned with quantum data compression of asymptotically many independent and identically distributed copies of ensembles of mixed quantum states. The encoder has access to a side information system. The figure of merit is…

Quantum Physics · Physics 2024-06-21 Zahra Baghali Khanian , Kohdai Kuroiwa , Debbie Leung

This paper investigates a lossy source coding problem in which two decoders can access their side-information respectively. The correlated sources are a product of two component correlated sources, and we exclusively investigate the case…

Information Theory · Computer Science 2013-05-29 Shun Watanabe

Shaping codes are used to encode information for use on channels with cost constraints. Applications include data transmission with a power constraint and, more recently, data storage on flash memories with a constraint on memory cell wear.…

Information Theory · Computer Science 2020-01-10 Yi Liu , Pengfei Huang , Alexander W. Bergman , Paul H. Siegel

In this paper the relation between nonanticipative rate distortion function (RDF) and Bayesian filtering theory is further investigated on general Polish spaces. The relation is established via an optimization on the space of conditional…

Information Theory · Computer Science 2014-01-21 Photios A. Stavrou , Charalambos D. Charalambous

A rekindled the interest in auto-encoder algorithms has been spurred by recent work on deep learning. Current efforts have been directed towards effective training of auto-encoder architectures with a large number of coding units. Here, we…

Machine Learning · Computer Science 2014-04-18 Luis G. Sanchez Giraldo , Jose C. Principe

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

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

A causal rate distortion function with a general fidelity criterion is formulated on abstract alphabets and a coding theorem is derived. Existence of the minimizing kernel is shown using the topology of weak convergence of probability…

Information Theory · Computer Science 2012-02-07 Photios A. Stavrou , Charalambos D. Charalambous , Christos K. Kourtellaris

The rate-distortion curve captures the fundamental tradeoff between compression length and resolution in lossy data compression. However, it conceals the underlying dynamics of optimal source encodings or test channels. We argue that these…

Information Theory · Computer Science 2023-07-03 Shlomi Agmon

In this paper, we study the rate distortion function of the i.i.d sequence of multiplications of a Bernoulli $p$ random variable and a gaussian random variable $\sim N(0,1)$. We use a new technique in the derivation of the lower bound in…

Information Theory · Computer Science 2016-11-15 Cheng Chang

We consider a problem of coding for computing, where the decoder wishes to estimate a function of its local message and the source message at the encoder within a given distortion. We show that the rate-distortion function can be…

Information Theory · Computer Science 2022-05-18 Deheng Yuan , Tao Guo , Bo Bai , Wei Han

The objective of this paper is to further investigate various applications of information Nonanticipative Rate Distortion Function (NRDF) by discussing two working examples, the Binary Symmetric Markov Source with parameter $p$ (BSMS($p$))…

Information Theory · Computer Science 2014-04-30 Photios A. Stavrou , Christos K. Kourtellaris , Charalambos D. Charalambous

An intuitive outer bound for the multiterminal source coding problem is given. The proposed bound explicitly couples the rate distortion functions for each source and correlation measures which derive from a "strong" data processing…

Information Theory · Computer Science 2013-07-17 Thomas A. Courtade

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

A receiver wants to compute a function of two correlated sources separately observed by two transmitters. One of the transmitters may send a possibly private message to the other transmitter in a cooperation phase before both transmitters…

Information Theory · Computer Science 2015-04-08 Milad Sefidgaran , Aslan Tchamkerten

This paper is concerned with a rate-distortion theory for sequences of i.i.d. random variables with general distribution supported on general sets including manifolds and fractal sets. Manifold structures are prevalent in data science,…

Information Theory · Computer Science 2018-04-25 Erwin Riegler , Günther Koliander , Helmut Bölcskei

In this paper, we provide three applications for $f$-divergences: (i) we introduce Sanov's upper bound on the tail probability of the sum of independent random variables based on super-modular $f$-divergence and show that our generalized…

Information Theory · Computer Science 2023-01-27 Saeed Masiha , Amin Gohari , Mohammad Hossein Yassaee

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