English
Related papers

Related papers: Network Compression: Worst-Case Analysis

200 papers

Path planning is an important component of au- tonomous mobile sensing systems. This paper studies upper and lower bounds of communication performance over Gaussian sen- sor networks, to drive power-distortion metrics for path planning…

Information Theory · Computer Science 2016-02-23 Emrah Akyol , Urbashi Mitra

We extend previous results on covert communication over the additive white Gaussian noise channel to two other types of additive noise channels. The first is the Gaussian channel with memory, where the noise sequence is a Gaussian vector…

Information Theory · Computer Science 2023-03-22 Cécile Bouette , Laura Luzzi , Ligong Wang

Locating sources of diffusion and spreading from minimum data is a significant problem in network science with great applied values to the society. However, a general theoretical framework dealing with optimal source localization is…

Social and Information Networks · Computer Science 2017-03-16 Zhao-Long Hu , Xiao Han , Ying-Cheng Lai , Wen-Xu Wang

A transmitter without channel state information (CSI) wishes to send a delay-limited Gaussian source over a slowly fading channel. The source is coded in superimposed layers, with each layer successively refining the description in the…

Information Theory · Computer Science 2009-10-22 Chris T. K. Ng , Deniz Gunduz , Andrea Goldsmith , Elza Erkip

The two-way capacities of quantum channels determine the ultimate entanglement and secret-key distribution rates achievable by two distant parties that are connected by a noisy transmission line, in absence of quantum repeaters. Since…

Quantum Physics · Physics 2025-01-27 Francesco Anna Mele , Ludovico Lami , Vittorio Giovannetti

This work considers the problem of transmitting multiple compressible sources over a network at minimum cost. The aim is to find the optimal rates at which the sources should be compressed and the network flows using which they should be…

Information Theory · Computer Science 2009-08-13 Aditya Ramamoorthy

We consider the source-channel separation architecture for lossy source coding in communication networks. It is shown that the separation approach is optimal in two general scenarios, and is approximately optimal in a third scenario. The…

Information Theory · Computer Science 2013-12-04 Chao Tian , Jun Chen , Suhas Diggavi , Shlomo Shamai

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

In the era of big data, it is necessary to split extremely large data sets across multiple computing nodes and construct estimators using the distributed data. When designing distributed estimators, it is desirable to minimize the amount of…

Statistics Theory · Mathematics 2022-04-25 Azeem Zaman , Botond Szabó

Jointly Gaussian memoryless sources are observed at N distinct terminals. The goal is to efficiently encode the observations in a distributed fashion so as to enable reconstruction of any one of the observations, say the first one, at the…

Information Theory · Computer Science 2008-05-14 Saurabha Tavildar , Pramod Viswanath , Aaron B. Wagner

We consider the problem of transmitting a bivariate Gaussian source over a two-user additive Gaussian multiple-access channel with feedback. Each of the transmitters observes one of the source components and tries to describe it to the…

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

Achievability and converse results for the lossy transmission of correlated sources over Shannon's two-way channels (TWCs) are presented. A joint source-channel coding theorem for independent sources and TWCs for which adaptation cannot…

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

We address the capacity of a discrete-time memoryless Gaussian channel, where the channel state information (CSI) is neither available at the transmitter nor at the receiver. The optimal capacity-achieving input distribution at low…

Information Theory · Computer Science 2008-05-05 Z. Rezki , David Haccoun , François Gagnon

We consider distributed estimation of a Gaussian source in a heterogenous bandwidth constrained sensor network, where the source is corrupted by independent multiplicative and additive observation noises, with incomplete statistical…

Information Theory · Computer Science 2018-05-23 Alireza Sani , Azadeh Vosoughi

We consider the k-encoder source coding problem with a quadratic distortion measure. We show that among all source distributions with a given covariance matrix K, the jointly Gaussian source requires the highest rates in order to meet a…

Information Theory · Computer Science 2016-11-15 Ilan Shomorony , A. Salman Avestimehr , Himanshu Asnani , Tsachy Weissman

We investigate the optimal performance of dense sensor networks by studying the joint source-channel coding problem. The overall goal of the sensor network is to take measurements from an underlying random process, code and transmit those…

Information Theory · Computer Science 2007-07-13 Nan Liu , Sennur Ulukus

We study the second-order asymptotics of information transmission using random Gaussian codebooks and nearest neighbor (NN) decoding over a power-limited stationary memoryless additive non-Gaussian noise channel. We show that the dispersion…

Information Theory · Computer Science 2016-10-20 Jonathan Scarlett , Vincent Y. F. Tan , Giuseppe Durisi

It has been shown lately the optimality of uncoded transmission in estimating Gaussian sources over homogeneous/symmetric Gaussian multiple access channels (MAC) using multiple sensors. It remains, however, unclear whether it still holds…

Information Theory · Computer Science 2007-09-27 Shuangqing Wei , Rajgopal Kannan , Sitharama Iyengar , Nageswara S. Rao

Consider a Gaussian relay network where a number of sources communicate to a destination with the help of several layers of relays. Recent work has shown that a compress-and-forward based strategy at the relays can achieve the capacity of…

Information Theory · Computer Science 2013-04-30 Ritesh Kolte , Ayfer Özgür

This paper considers the problem of lossy compression for the computation of a function of two correlated sources, both of which are observed at the encoder. Due to presence of observation costs, the encoder is allowed to observe only…

Information Theory · Computer Science 2013-07-22 Xi Liu , Osvaldo Simeone , Elza Erkip