English
Related papers

Related papers: Achievable Rates for Information Extraction from a…

200 papers

In this work, lossy distributed compression of pairs of correlated sources is considered. Conventionally, Shannon's random coding arguments -- using randomly generated unstructured codebooks whose blocklength is taken to be asymptotically…

Information Theory · Computer Science 2020-10-21 Farhad Shirani , S. Sandeep Pradhan

We propose a novel framework to learn how to communicate with intent, i.e., to transmit messages over a wireless communication channel based on the end-goal of the communication. This stays in stark contrast to classical communication…

Signal Processing · Electrical Eng. & Systems 2022-11-24 Miguel Angel Gutierrez-Estevez , Yiqun Wu , Chan Zhou

Consider the problem where a statistician in a two-node system receives rate-limited information from a transmitter about marginal observations of a memoryless process generated from two possible distributions. Using its own observations,…

Information Theory · Computer Science 2017-03-02 Gil Katz , Pablo Piantanida , Mérouane Debbah

Suppose that there are $n$ Senders and $n$ Receivers. Our goal is to send long messages from Sender $i$ to Receiver $i$ such that no other receiver can retrieve the message intended for Receiver $i$. The task can easily be completed using…

Computational Complexity · Computer Science 2007-05-23 Vince Grolmusz

This paper formulates a distributed computation problem, where a master asks $N$ distributed workers to compute a linearly separable function. The task function can be expressed as $K_c$ linear combinations of $K$ messages, where each…

Information Theory · Computer Science 2021-10-26 Kai Wan , Hua Sun , Mingyue Ji , Giuseppe Caire

Index coding is concerned with efficient broadcast of a set of messages to receivers in the presence of receiver side information. In this paper, we study the secure index coding problem with security constraints on the receivers…

Information Theory · Computer Science 2020-04-16 Yucheng Liu , Parastoo Sadeghi , Neda Aboutorab , Arman Sharififar

We consider unsourced random access with MIMO receiver - a crucial communication scenario for future 5G/6G wireless networks. We perform a projection-based decoder analysis and derive energy efficiency achievability bounds when channel…

Information Theory · Computer Science 2023-03-28 Kirill Andreev , Daria Ustinova , Alexey Frolov

We consider the discrete memoryless symmetric primitive relay channel, where, a source $X$ wants to send information to a destination $Y$ with the help of a relay $Z$ and the relay can communicate to the destination via an error-free…

Information Theory · Computer Science 2016-03-31 Xiugang Wu , Ayfer Ozgur , Liang-Liang Xie

In this report, we investigate the data transmission model in which a sequence of data is broadcasted to a number of receivers. The receivers, which have different channel capacities, wish to decode the data sequentially at different rates.…

Information Theory · Computer Science 2012-10-15 Cheuk Ting LI

Energy harvesting (EH) from ambient radio-frequency (RF) electromagnetic waves is an efficient solution for fully autonomous and sustainable communication networks. Most of the related works presented in the literature are based on specific…

Information Theory · Computer Science 2016-11-18 Ioannis Krikidis

This work considers distributed sensing and transmission of sporadic random samples. Lower bounds are derived for the reconstruction error of a single normally or uniformly-distributed finite-dimensional vector imperfectly measured by a…

Information Theory · Computer Science 2015-11-20 Ayşe Ünsal , Raymond Knopp

The scaling laws of the achievable communication rates and the corresponding upper bounds of distributed reception in the presence of an interfering signal are investigated. The scheme includes one transmitter communicating to a remote…

Information Theory · Computer Science 2009-12-08 Amichai Sanderovich , Michael Peleg , Shlomo Shamai

In this paper, we derive information-theoretic performance limits for three classes of two-user state-dependent discrete memoryless broadcast channels, with noncausal side-information at the encoder. The first class of channels comprises a…

Information Theory · Computer Science 2012-07-17 K. G. Nagananda , Chandra R. Murthy , Shalinee Kishore

This paper characterizes the secret message capacity of three networks where two unicast sessions share some of the communication resources. Each network consists of erasure channels with state feedback. A passive eavesdropper is assumed to…

Information Theory · Computer Science 2018-10-16 Gaurav Kumar Agarwal , Martina Cardone , Christina Fragouli

For discrete memoryless multiple-access channels, we propose a general definition of variable length codes with a measure of the transmission rates at the receiver side. This gives a receiver perspective on the multiple-access channel…

Information Theory · Computer Science 2011-02-28 Stephane Musy

For multi-user transmissions over MIMO interference channels, each user designs the transmit covariance matrix to maximize its information rate. When passive radio-frequency (RF) energy harvesters are present in the network, the…

Information Theory · Computer Science 2017-04-14 Liang Dong

Consider binary linear codes obtained from bipartite graphs as follows. There are~\(k \geq 1\) left nodes each representing a message bit and there are~\(m = m(k)\) right nodes each representing a parity bit, generated from the…

Probability · Mathematics 2017-09-13 Ghurumuruhan Ganesan

The secrecy rate region of wiretap interference channels with a multi-antenna passive eavesdropper is studied under receiver energy harvesting constraints. To stay operational in the network, the legitimate receivers demand energy alongside…

Information Theory · Computer Science 2019-03-01 Ali Kariminezhad , Zohaib Hassan Awan , Hendrik Vogt , Aydin Sezgin

We consider a wireless network composed of three nodes and limited by the half-duplex and total power constraints. This formulation encompasses many of the special cases studied in the literature and allows for capturing the common features…

Information Theory · Computer Science 2007-07-13 Lifeng Lai , Ke Liu , Hesham El Gamal

The task of jointly communicating a message and reconstructing a common estimate of the channel state is examined for a fading Gaussian model with additive state interference. The state is an independent and identically distributed Gaussian…

Information Theory · Computer Science 2026-01-07 Viswanathan Ramachandran