English
Related papers

Related papers: Side-information Scalable Source Coding

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 consider the problem of lossy source coding with side information under a privacy constraint that the reconstruction sequence at a decoder should be kept secret to a certain extent from another terminal such as an eavesdropper, a sender,…

Information Theory · Computer Science 2014-06-25 Kittipong Kittichokechai , Tobias J. Oechtering , Mikael Skoglund

We consider source coding with fixed lag side information at the decoder. We focus on the special case of perfect side information with unit lag corresponding to source coding with feedforward (the dual of channel coding with feedback)…

Information Theory · Computer Science 2007-07-16 Emin Martinian , Gregory W. Wornell

Distributed source coding (DSC) addresses the compression of correlated sources without communication links among them. This paper is concerned with the Wyner-Ziv problem: coding of an information source with side information available only…

Information Theory · Computer Science 2011-11-08 Cong Ling , Su Gao , Jean-Claude Belfiore

Scalar quantization and probabilistic shaping are applied to the distributed source coding of Gaussian sources, with mean-square error distortion. A coding scheme with a modulo interval, dithering, and truncated Gaussian shaping is shown to…

Information Theory · Computer Science 2026-04-21 Muhammed Yusuf Sener , Gerhard Kramer , Shlomo Shamai , Ronald Böhnke , Wen Xu

In this paper, we derive information-theoretic performance limits for secure and reliable communications over the general two-user discrete memoryless broadcast channel with side-information at the transmitter. The sender wishes to…

Information Theory · Computer Science 2011-09-27 K. G. Nagananda , Chandra R Murthy , Shalinee Kishore

We are interested in how to best communicate a (usually real valued) source to a number of destinations (sinks) over a network with capacity constraints in a collective fidelity metric over all the sinks, a problem which we call joint…

Information Theory · Computer Science 2007-07-13 Nima Sarshar , Xiaolin Wu

We present a Deep Image Compression neural network that relies on side information, which is only available to the decoder. We base our algorithm on the assumption that the image available to the encoder and the image available to the…

Computer Vision and Pattern Recognition · Computer Science 2020-07-30 Sharon Ayzik , Shai Avidan

We consider the joint source-channel coding problem of sending a Gaussian source on a K-user Gaussian broadcast channel with bandwidth mismatch. A new outer bound to the achievable distortion region is derived using the technique of…

Information Theory · Computer Science 2010-11-22 Chao Tian , Suhas Diggavi , Shlomo Shamai

A likelihood encoder is studied in the context of lossy source compression. The analysis of the likelihood encoder is based on the soft-covering lemma. It is demonstrated that the use of a likelihood encoder together with the soft-covering…

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

We study the problem of compressing a source sequence in the presence of side-information that is related to the source via insertions, deletions and substitutions. We propose a simple algorithm to compress the source sequence when the…

Information Theory · Computer Science 2016-11-15 Nan Ma , Kannan Ramchandran , David Tse

In this paper we study the Z channel with side information non-causally available at the encoders. We use Marton encoding along with Gelfand-Pinsker random binning scheme and Chong-Motani-Garg-El Gamal (CMGE) jointly decoding to find an…

Information Theory · Computer Science 2015-06-03 Saeed Hajizadeh , Mostafa Monemizadeh

This paper characterizes the second-order coding rates for lossy source coding with side information available at both the encoder and the decoder. We first provide non-asymptotic bounds for this problem and then specialize the…

Information Theory · Computer Science 2014-10-13 Sy-Quoc Le , Vincent Y. F. Tan , Mehul Motani

The problem of joint source-channel coding in transmitting independent sources over interference channels with correlated receiver side information is studied. When each receiver has side information correlated with its own desired source,…

Information Theory · Computer Science 2008-10-15 Nan Liu , Deniz Gunduz , Andrea J. Goldsmith , H. Vincent Poor

We present the problem of two-terminal source coding with Common Sum Reconstruction (CSR). Consider two terminals, each with access to one of two correlated sources. Both terminals want to reconstruct the sum of the two sources under some…

Information Theory · Computer Science 2022-09-26 Tharindu Adikari , Stark Draper

We study a lossy source coding problem for a memoryless remote source. The source data is broadcast over an arbitrarily varying channel (AVC) controlled by an adversary. One output of the AVC is received as input at the encoder, and another…

Information Theory · Computer Science 2017-04-26 Amitalok J. Budkuley , Bikash Kumar Dey , Vinod M. Prabhakaran

Wyner's common information was originally defined for a pair of dependent discrete random variables. Its significance is largely reflected in, hence also confined to, several existing interpretations in various source coding problems. This…

Information Theory · Computer Science 2013-01-11 Ge Xu , Wei Liu , Biao Chen

The problem of secure source coding with multiple terminals is extended by considering a remote source whose noisy measurements are the correlated random variables used for secure source reconstruction. The main additions to the problem…

Information Theory · Computer Science 2022-11-10 Onur Günlü , Rafael F. Schaefer , Holger Boche , H. Vincent Poor

We investigate the problem of strong coordination over a multiple-access channel (MAC) with cribbing encoders. In this configuration, two encoders observe independent and identically distributed (i.i.d.) samples of a source random variable…

Information Theory · Computer Science 2025-06-06 Viswanathan Ramachandran , Tobias J. Oechtering , Mikael Skoglund

Semantic communication has attracted significant interest recently due to its capability to meet the fast growing demand on user-defined and human-oriented communication services such as holographic communications, eXtended reality (XR),…

Information Theory · Computer Science 2023-12-12 Jingxuan Chai , Yong Xiao , Guangming Shi , Walid Saad
‹ Prev 1 3 4 5 6 7 10 Next ›