English
Related papers

Related papers: Computing the Rate-Distortion Function of Gray-Wyn…

200 papers

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 derive quantum counterparts of two key theorems of classical information theory, namely, the rate distortion theorem and the source-channel separation theorem. The rate-distortion theorem gives the ultimate limits on lossy data…

Quantum Physics · Physics 2012-12-21 Nilanjana Datta , Min-Hsiu Hsieh , Mark M. Wilde

Explicit constructions of polar codes and polar lattices for both lossless and lossy Gray-Wyner problems are studied. Polar codes are employed to extract Wyner's common information of doubly symmetric binary source; polar lattices are then…

Information Theory · Computer Science 2016-10-26 Jinwen Shi , Ling Liu , Cong Ling

In this paper we analyze the joint rate distortion function (RDF), for a tuple of correlated sources taking values in abstract alphabet spaces (i.e., continuous) subject to two individual distortion criteria. First, we derive structural…

Information Theory · Computer Science 2021-05-11 Evagoras Stylianou , Charalambos D. Charalambous , Themistoklis Charalambous

The two most prevalent notions of common information (CI) are due to Wyner and Gacs-Korner and both the notions can be stated as two different characteristic points in the lossless Gray-Wyner region. Although the information theoretic…

Information Theory · Computer Science 2014-04-01 Kumar Viswanatha , Emrah Akyol , Kenneth Rose

The rate-distortion saddle-point problem considered by Lapidoth (1997) consists in finding the minimum rate to compress an arbitrary ergodic source when one is constrained to use a random Gaussian codebook and minimum (Euclidean) distance…

Information Theory · Computer Science 2018-09-03 Lin Zhou , Vincent Y. F. Tan , Mehul Motani

We consider the semantic rate-distortion problem motivated by task-oriented video compression. The semantic information corresponding to the task, which is not observable to the encoder, shows impacts on the observations through a joint…

Information Theory · Computer Science 2022-08-15 Tao Guo , Yizhu Wang , Jie Han , Huihui Wu , Bo Bai , Wei Han

In this article we use rate-distortion theory, a branch of information theory devoted to the problem of lossy compression, to shed light on an important problem in latent variable modeling of data: is there room to improve the model? One…

Machine Learning · Computer Science 2019-04-17 Luis A. Lastras

In this paper, we analyze the indirect source coding problem with side information at both the encoder and decoder, as well as only at the decoder. We first derive structural properties of the two rate distortion functions (RDFs) for…

Information Theory · Computer Science 2024-10-14 Evagoras Stylianou , Michail Gkagkos , Charalambos D. Charalambous

This paper investigates the general distributed lossless/lossy source coding formulated by Jana and Blahut. Their multi-letter rate-distortion region, an alternative to the region derived by Yang and Qin, is characterized by entropy…

Information Theory · Computer Science 2024-07-08 Jun Muramatsu

Recently, a number of authors have proposed decoding schemes for Reed-Solomon (RS) codes based on multiple trials of a simple RS decoding algorithm. In this paper, we present a rate-distortion (R-D) approach to analyze these…

Information Theory · Computer Science 2009-08-21 Phong S. Nguyen , Henry D. Pfister , Krishna R. Narayanan

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

Many images and videos are primarily processed by computer vision algorithms, involving only occasional human inspection. When this content requires compression before processing, e.g., in distributed applications, coding methods must…

Image and Video Processing · Electrical Eng. & Systems 2025-08-27 Samuel Fernández-Menduiña , Eduardo Pavez , Antonio Ortega

We show that polar codes can be used to achieve the rate-distortion functions in the problem of hierarchical source coding also known as the successive refinement problem. We also analyze the distributed version of this problem,…

Information Theory · Computer Science 2015-09-22 Min Ye , Alexander Barg

In the context of lossy compression, Blau & Michaeli (2019) adopt a mathematical notion of perceptual quality and define the information rate-distortion-perception function, generalizing the classical rate-distortion tradeoff. We consider…

Information Theory · Computer Science 2021-12-23 George Zhang , Jingjing Qian , Jun Chen , Ashish Khisti

We propose computationally efficient encoders and decoders for lossy compression using a Sparse Regression Code. The codebook is defined by a design matrix and codewords are structured linear combinations of columns of this matrix. The…

Information Theory · Computer Science 2014-05-20 Ramji Venkataramanan , Tuhin Sarkar , Sekhar Tatikonda

In this paper, distributed (or multiterminal) source coding with one distortion criterion and correlated messages is considered. This problem can be also called ``Berger-Yeung problem with correlated messages''. It corresponds to the source…

Information Theory · Computer Science 2009-08-18 Suhan Choi

Consider a generalized multiterminal source coding system, where $\ell\choose m$ encoders, each observing a distinct size-$m$ subset of $\ell$ ($\ell\geq 2$) zero-mean unit-variance symmetrically correlated Gaussian sources with correlation…

Information Theory · Computer Science 2017-10-16 Jun Chen , Li Xie , Yameng Chang , Jia Wang , Yizhong Wang

A variational principle for the rate distortion (RD) theory with Bregman divergences is formulated within the ambit of the generalized (nonextensive) statistics of Tsallis. The Tsallis-Bregman RD lower bound is established. Alternate…

Statistical Mechanics · Physics 2007-07-13 R. C. Venkatesan

We consider the problem of causal source coding and causal decoding of a Gauss--Markov source, where the decoder has causal access to a side-information signal. We define the information causal rate-distortion function with causal decoder…

Information Theory · Computer Science 2020-08-13 Omri Lev , Anatoly Khina