English
Related papers

Related papers: One-Shot Wyner-Ziv Compression of a Uniform Source

200 papers

We simply construct a quantum universal variable-length source code in which, independent of information source, both of the average error and the probability that the coding rate is greater than the entropy rate $H(rho_p)$, tend to 0. If…

Quantum Physics · Physics 2007-05-23 Masahito Hayashi , Keiji Matsumoto

In this paper, we propose {\em distributed network compression via memory}. We consider two spatially separated sources with correlated unknown source parameters. We wish to study the universal compression of a sequence of length $n$ from…

Information Theory · Computer Science 2012-10-09 Ahmad Beirami , Faramarz Fekri

This paper considers lossy source coding of $n$-dimensional memoryless sources and shows an explicit approximation to the minimum source coding rate required to sustain the probability of exceeding distortion $d$ no greater than $\epsilon$,…

Information Theory · Computer Science 2017-02-28 Victoria Kostina

We consider universal variable-to-fixed length compression of memoryless sources with a fidelity criterion. We design a dictionary codebook over the reproduction alphabet which is used to parse the source stream. Once a source subsequence…

Information Theory · Computer Science 2022-11-24 Nematollah Iri

Physics concepts have often been borrowed and independently developed by other fields of science. In this perspective a significant example is that of entropy in Information Theory. The aim of this paper is to provide a short and…

Physics Education · Physics 2007-05-23 Andrea Baronchelli , Emanuele Caglioti , Vittorio Loreto

Quantum information decoupling is a fundamental primitive in quantum information theory, underlying various applications in quantum physics. We prove a novel one-shot decoupling theorem formulated in terms of quantum relative entropy…

Quantum Physics · Physics 2026-02-20 Mario Berta , Hao-Chung Cheng , Yongsheng Yao

This paper investigates the benefits of the side information on the universal compression of sequences from a mixture of $K$ parametric sources. The output sequence of the mixture source is chosen from the source $i \in \{1,\ldots ,K\}$…

Information Theory · Computer Science 2014-12-01 Ahmad Beirami , Liling Huang , Mohsen Sardari , Faramarz Fekri

We study the joint source channel coding problem of transmitting an analog source over a Gaussian channel in two cases - (i) the presence of interference known only to the transmitter and (ii) in the presence of side information known only…

Information Theory · Computer Science 2016-09-08 Makesh Pravin Wilson , Krishna Narayanan , Giuseppe Caire

The ever-growing amounts of visual contents captured on a daily basis necessitate the use of lossy compression methods in order to save storage space and transmission bandwidth. While extensive research efforts are devoted to improving…

Image and Video Processing · Electrical Eng. & Systems 2021-03-30 Yuval Bahat , Tomer Michaeli

We study a one-shot joint source-channel coding setting where the source is encoded once and broadcast to $K$ decoders through independent channels. Success is predicated on at least one decoder recovering the source within a maximum…

Information Theory · Computer Science 2026-04-17 Joseph Rowan , Buu Phan , Ashish Khisti

We consider the following communication task in the multi-party setting, which involves a joint random variable $XYZMN$ with the property that $M$ is independent of $YZN$ conditioned on $X$ and $N$ is independent of $XZM$ conditioned on…

Information Theory · Computer Science 2020-03-24 Anurag Anshu , Penghui Yao

Lossy image compression is a many-to-one process, thus one bitstream corresponds to multiple possible original images, especially at low bit rates. However, this nature was seldom considered in previous studies on image compression, which…

Image and Video Processing · Electrical Eng. & Systems 2021-10-01 Haichuan Ma , Dong Liu , Cunhui Dong , Li Li , Feng Wu

We present adaptive on-line schemes for lossy encoding of individual sequences under the conditions of the Wyner-Ziv (WZ) problem. In the first part of this article, a set of fixed-rate scalar source codes with zero delay is presented. We…

Information Theory · Computer Science 2009-08-12 Avraham Reani , Neri Merhav

We examine the coordinated and universal rate-efficient sampling of a subset of correlated discrete memoryless sources followed by lossy compression of the sampled sources. The goal is to reconstruct a predesignated subset of sources within…

Information Theory · Computer Science 2017-06-23 Vinay Praneeth Boda , Prakash Narayan

We study the problem of lossy joint source-channel coding in a single-user energy harvesting communication system with causal energy arrivals and the energy storage unit may have leakage. In particular, we investigate the achievable…

Information Theory · Computer Science 2015-08-20 Meysam Shahrbaf Motlagh , Masoud Badiei Khuzani , Patrick Mitran

Motivated by the need for communication-efficient distributed learning, we investigate the method for compressing a unit norm vector into the minimum number of bits, while still allowing for some acceptable level of distortion in recovery.…

Information Theory · Computer Science 2024-02-06 Heng Zhu , Avishek Ghosh , Arya Mazumdar

We consider state redistribution of a "hybrid" information source that has both classical and quantum components. The sender transmits classical and quantum information at the same time to the receiver, in the presence of classical and…

Quantum Physics · Physics 2022-06-01 Eyuri Wakakuwa , Yoshifumi Nakata , Min-Hsiu Hsieh

Capacity of a quantum channel characterizes the limits of reliable communication through a noisy quantum channel. This fundamental information theoretic question is very well studied specially in the setting of many independent uses of the…

Quantum Physics · Physics 2019-03-19 Anurag Anshu , Rahul Jain , Naqueeb Ahmad Warsi

We study joint source-channel coding (JSCC) of compressed sensing (CS) measurements using vector quantizer (VQ). We develop a framework for realizing optimum JSCC schemes that enable encoding and transmitting CS measurements of a sparse…

Information Theory · Computer Science 2014-06-03 Amirpasha Shirazinia , Saikat Chatterjee , Mikael Skoglund

Packets originated from an information source in the network can be highly correlated. These packets are often routed through different paths, and compressing them requires to process them individually. Traditional universal compression…

Information Theory · Computer Science 2019-01-14 Ahmad Beirami , Faramarz Fekri