English
Related papers

Related papers: Many-Help-One Problem for Gaussian Sources with a …

200 papers

Locally decodable channel codes form a special class of error-correcting codes with the property that the decoder is able to reconstruct any bit of the input message from querying only a few bits of a noisy codeword. It is well known that…

Information Theory · Computer Science 2013-08-28 Ali Makhdoumi , Shao-Lun Huang , Muriel Medard , Yury Polyanskiy

We study the following semi-deterministic setting of the joint source-channel coding problem: a deterministic source sequence (a.k.a. individual sequence) is transmitted via a memoryless channel, using delay-limited encoder and decoder,…

Information Theory · Computer Science 2021-09-29 Neri Merhav

The connection between dependency trees and spanning trees is exploited by the NLP community to train and to decode graph-based dependency parsers. However, the NLP literature has missed an important difference between the two structures:…

Computation and Language · Computer Science 2020-10-08 Ran Zmigrod , Tim Vieira , Ryan Cotterell

We study lossy source coding under a distortion measure defined by the negative log-likelihood induced by a prescribed conditional distribution $P_{X|U}$. This \emph{log-likelihood distortion} models compression settings in which the…

Information Theory · Computer Science 2026-01-26 Anuj Kumar Yadav , Dan Song , Yanina Shkel , Ayfer Özgür

This paper presents a one shot analysis of the lossy compression problem under average distortion constraints. We calculate the exact expected distortion of a random code. The result is given as an integral formula using a newly defined…

Information Theory · Computer Science 2020-05-18 Nir Elkayam , Meir Feder

Among many current data processing systems, the objectives are often not the reproduction of data, but to compute some answers based on the data resulting from queries. The similarity identification task is to identify the items in a…

Signal Processing · Electrical Eng. & Systems 2020-01-23 Hanwei Wu , Qiwen Wang , Markus Flierl

We consider the asymmetric multilevel diversity (A-MLD) coding problem, where a set of $2^K-1$ information sources, ordered in a decreasing level of importance, is encoded into $K$ messages (or descriptions). There are $2^K-1$ decoders,…

Information Theory · Computer Science 2009-11-13 Soheil Mohajer , Chao Tian , Suhas N. Diggavi

Quantum random variable, distortion operator are introduced based on canonical operators. As the lower bound of rate distortion, the entanglement information rate distortion is achieved by Gaussian map for Gaussian source. General Gaussian…

Quantum Physics · Physics 2007-05-23 Xiao-yu Chen

The problem of joint universal source coding and identification is considered in the setting of fixed-rate lossy coding of continuous-alphabet memoryless sources. For a wide class of bounded distortion measures, it is shown that any…

Information Theory · Computer Science 2007-07-13 Maxim Raginsky

A multiterminal lossy coding problem, which includes various problems such as the Wyner-Ziv problem and the complementary delivery problem as special cases, is considered. It is shown that any point in the achievable rate-distortion region…

Information Theory · Computer Science 2010-04-20 Shigeaki Kuzuoka , Akisato Kimura , Tomohiko Uyematsu

Motivated by the lossy compression of an active-vision video stream, we consider the problem of finding the rate-distortion function of an arbitrarily varying source (AVS) composed of a finite number of subsources with known distributions.…

Information Theory · Computer Science 2016-09-08 Hari Palaiyanur , Cheng Chang , Anant Sahai

This paper investigates a unification of distributed source coding, multiple description coding, and source coding with side information at decoders. The equivalence between the multiple-decoder extension of distributed source coding with…

Information Theory · Computer Science 2024-10-28 Jun Muramatsu

A computable expression for the rate-distortion (RD) function proposed by Heegard and Berger has eluded information theory for nearly three decades. Heegard and Berger's single-letter achievability bound is well known to be optimal for…

Information Theory · Computer Science 2012-12-12 Roy Timo , Tobias J. Oechtering , Michèle Wigger

This paper provides a source coding theorem for multi-dimensional information signals when, at a given instant, the distribution associated with one arbitrary component of the signal to be compressed is not known and a side information is…

Information Theory · Computer Science 2012-10-24 Maël Le Treust , Samson Lasaulce

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 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

A secrecy system with side information at the decoders is studied in the context of lossy source compression over a noiseless broadcast channel. The decoders have access to different side information sequences that are correlated with the…

Information Theory · Computer Science 2014-10-07 Eva C. Song , Paul Cuff , H. Vincent Poor

Rate-distortion formulation is the information-theoretic approach to the study of signal encoding systems. Since a more general approach to model the nonstationarity exhibited by real-world signals is to use appropriately fitted time…

Information Theory · Computer Science 2019-11-01 Jia-Chyi Wu

We consider a problem where a memoryless bi-variate Gaussian source is to be transmitted over an additive white Gaussian multiple-access channel with two transmitting terminals and one receiving terminal. The first transmitter only sees the…

Information Theory · Computer Science 2007-07-16 Amos Lapidoth , Stephan Tinguely

We begin by presenting a simple lossy compressor operating at near-zero rate: The encoder merely describes the indices of the few maximal source components, while the decoder's reconstruction is a natural estimate of the source components…

Information Theory · Computer Science 2016-03-09 Albert No , Tsachy Weissman