English
Related papers

Related papers: Two-terminal source coding with common sum reconst…

200 papers

We consider lossy compression of a binary symmetric source by means of a low-density generator-matrix code. We derive two lower bounds on the rate distortion function which are valid for any low-density generator-matrix code with a given…

Information Theory · Computer Science 2008-04-11 Shrinivas Kudekar , Ruediger Urbanke

We propose a novel joint decoding technique for distributed source-channel (DSC) coded systems for transmission of correlated binary Markov sources over additive white Gaussian noise (AWGN) channels. In the proposed scheme, relatively…

Information Theory · Computer Science 2013-08-02 Reza Asvadi , Tad Matsumoto , Markku Juntti

For variable-length coding with an almost-sure distortion constraint, Zhang et al. show that for discrete sources the redundancy is upper bounded by $\log n/n$ and lower bounded (in most cases) by $\log n/(2n)$, ignoring lower order terms.…

Information Theory · Computer Science 2026-01-21 Sharang M. Sriramu , Aaron B. Wagner

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

In this paper, we consider a few iterative decoding schemes for the joint source-channel coding of correlated sources. Specifically, we consider the joint source-channel coding of two erasure correlated sources with transmission over…

Information Theory · Computer Science 2009-10-08 Arvind Yedla , Henry D. Pfister , Krishna R. Narayanan

A distributed lossy compression network with $L$ encoders and a decoder is considered. Each encoder observes a source and sends a compressed version to the decoder. The decoder produces a joint reconstruction of target signals with the mean…

Information Theory · Computer Science 2022-06-06 Siyao Zhou , Sadaf Salehkalaibar , Jingjing Qian , Jun Chen , Wuxian Shi , Yiqun Ge , Wen Tong

We study cooperation in multi terminal source coding models involving successive refinement. Specifically, we study the case of a single encoder and two decoders, where the encoder provides a common description to both the decoders and a…

Information Theory · Computer Science 2016-11-17 Himanshu Asnani , Haim Permuter , Tsachy Weissman

We devise achievable encoding schemes for distributed source compression for computing inner products, symmetric matrix products, and more generally, square matrix products, which are a class of nonlinear transformations. To that end, our…

Information Theory · Computer Science 2024-05-21 Derya Malak

We introduce an expurgation method for source coding with side information that enables direct dual-domain derivations of expurgated error exponents. Dual-domain methods yield optimization problems over few parameters, with any sub-optimal…

Information Theory · Computer Science 2026-02-25 Mehdi Dabirnia , Hamdi Joudeh , Albert Guillén i Fàbregas

An adaptive joint source-channel coding (JSCC) scheme is presented for transmitting correlated sources over discrete-memoryless two-way channels subject to distortion constraints. The proposed JSCC scheme makes use of the previously…

Information Theory · Computer Science 2020-08-13 Jian-Jia Weng , Fady Alajaji , Tamás Linder

We consider a directed acyclic network with multiple sources and multiple terminals where each terminal is interested in decoding the sum of independent sources generated at the source nodes. We describe a procedure whereby a simple…

Information Theory · Computer Science 2016-12-23 Ardhendu Tripathy , Aditya Ramamoorthy

Consider a multi-source network coding problem with correlated sources. While the fundamental limits are known, achieving them, in general, involves a computational burden due to the complex decoding process. Efficient solutions, on the…

Information Theory · Computer Science 2016-01-27 Salman Salamatian , Asaf Cohen , Muriel Médard

We propose a scheme that universally achieves the smallest possible compression rate for a class of sources with side information, and develop an application of this result for a joint source channel coding problem over a broadcast channel.

Information Theory · Computer Science 2014-09-30 Min Ye , Alexander Barg

We consider the $k$-user successive refinement problem with causal decoder side information and derive an exponential strong converse theorem. The rate-distortion region for the problem can be derived as a straightforward extension of the…

Information Theory · Computer Science 2019-05-22 Lin Zhou , Alfred Hero

We consider the distributed source coding system of $L$ correlated Gaussian sources $Y_i,i=1,2,...,L$ which are noisy observations of correlated Gaussian remote sources $X_k, k=1,2,...,K$. We assume that $Y^{L}={}^{\rm t}(Y_1,Y_2,$ $...,…

Information Theory · Computer Science 2011-02-21 Yasutada Oohama

Source extension is a reformulation of inverse problems in wave propagation, that at least in some cases leads to computationally tractable iterative solution methods. The core subproblem in all source extension methods is the solution of a…

Numerical Analysis · Mathematics 2022-04-01 William W. Symes

The complementary problems of masking and amplifying channel state information in the Gel'fand-Pinsker channel have recently been solved by Merhav and Shamai, and Kim et al., respectively. In this paper, we study a related source coding…

Information Theory · Computer Science 2016-11-15 Thomas Courtade

In this paper, the rate-distortion theory of the Gray-Wyner lossy source coding system is investigated. For the case of jointly Gaussian distributed sources, we establish an expression for the rate-distortion function under the constraint…

Information Theory · Computer Science 2023-03-29 Guojun Chen , Yinfei Xu , Ling Liu , Tiecheng Song , Jing Hu

Two main aims of this paper are to develop a numerical method to solve an inverse source problem for parabolic equations and apply it to solve a nonlinear coefficient inverse problem. The inverse source problem in this paper is the problem…

Analysis of PDEs · Mathematics 2019-06-06 Phuong Mai Nguyen , Loc Hoang Nguyen

While feasibility and obtaining a solution of a given network coding problem are well studied, the decoding procedure and complexity have not garnered much attention. We consider the decoding problem in a network wherein the sources…

Information Theory · Computer Science 2015-10-14 Anindya Gupta , B. Sundar Rajan
‹ Prev 1 8 9 10 Next ›