English
Related papers

Related papers: Communicating over the Torn-Paper Channel

200 papers

A generalization of the problem of writing on dirty paper is considered in which one transmitter sends a common message to multiple receivers. Each receiver experiences on its link an additive interference (in addition to the additive…

Information Theory · Computer Science 2007-07-13 Ashish Khisti , Uri Erez , Amos Lapidoth , Gregory Wornell

In this paper, the capacity of continuous-space electromagnetic channels, where transceivers are confined in given lossy regions, is analyzed. First of all, the regions confining the transceivers are assumed to be filled with dielectric,…

Information Theory · Computer Science 2016-06-21 Wonseok Jeon , Sae-Young Chung

Recently, Etkin, Tse, and Wang found the capacity region of the two-user Gaussian interference channel to within one bit/s/Hz. A natural goal is to apply this approach to the Gaussian interference channel with an arbitrary number of users.…

Information Theory · Computer Science 2016-11-17 Guy Bresler , Abhay Parekh , David Tse

Shannon's Capacity Theorem is the main concept behind the Theory of Communication. It says that if the amount of information contained in a signal is smaller than the channel capacity of a physical media of communication, it can be…

Chaotic Dynamics · Physics 2009-11-13 M. S. Baptista , J. Kurths

We consider the problem of determining asymptotic bounds on the capacity of a random ad hoc network. Previous approaches assumed a link layer model in which if a transmitter-receiver pair can communicate with each other, i.e., the Signal to…

Information Theory · Computer Science 2008-11-24 Vivek P. Mhatre , Catherine P. Rosenberg , Ravi R. Mazumdar

We show how to compress communication in selection protocols, where the goal is to agree on a sequence of random bits using only a broadcast channel. More specifically, we present a generic method for converting any selection protocol, into…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-05-14 Yael Tauman Kalai , Ilan Komargodski

This paper considers the multi-way relay channel (MWRC) where multiple users exchange messages via a single relay. The capacity region is derived for a special class of MWRCs where (i) the uplink and the downlink are separated in the sense…

Information Theory · Computer Science 2012-09-10 Lawrence Ong , Sarah J. Johnson

We investigate the capacity of opportunistic communication in the presence of dynamic and distributed spectral activity, i.e. when the time varying spectral holes sensed by the cognitive transmitter are correlated but not identical to those…

Information Theory · Computer Science 2010-04-27 Syed A. Jafar , Sudhir Srinivasa

In terabit-density magnetic recording, several bits of data can be replaced by the values of their neighbors in the storage medium. As a result, errors in the medium are dependent on each other and also on the data written. We consider a…

Information Theory · Computer Science 2011-11-23 Arya Mazumdar , Alexander Barg , Navin Kashyap

We study the arbitrarily varying relay channel, and establish the cutset bound and partial decode-forward bound on the random code capacity. We further determine the random code capacity for special cases. Then, we consider conditions under…

Information Theory · Computer Science 2019-06-26 Uzi Pereg , Yossef Steinberg

The continuous-time, peak-limited, infinite-bandwidth Poisson channel with spurious counts is considered. It is shown that if the times at which the spurious counts occur are known noncausally to the transmitter but not to the receiver,…

Information Theory · Computer Science 2009-10-05 Shraga Bross , Amos Lapidoth , Ligong Wang

All modern wireless communication technologies are based on electromagnetism. However, electromagnetic signals are susceptible to screening and blocking, so their availability cannot be guaranteed in adverse environments. This raises a…

Let $W$ be a binary-input memoryless symmetric (BMS) channel with Shannon capacity $I(W)$ and fix any $\alpha > 0$. We construct, for any sufficiently small $\delta > 0$, binary linear codes of block length $O(1/\delta^{2+\alpha})$ and rate…

Information Theory · Computer Science 2022-01-25 Venkatesan Guruswami , Andrii Riazanov , Min Ye

A quantum communication channel can be put to many uses: it can transmit classical information, private classical information, or quantum information. It can be used alone, with shared entanglement, or together with other channels. For each…

Information Theory · Computer Science 2010-07-20 Graeme Smith

Quantum communication holds a promise for absolutely secure transmission of secret messages and faithful transfer of unknown quantum states. Photonic channels appear to be very attractive for physical implementation of quantum…

Quantum Physics · Physics 2009-11-07 Lu-Ming Duan , Mikhail Lukin , Ignacio Cirac , Peter Zoller

In this paper the study of the cognitive interference channel with a common message, a variation of the classical cognitive interference channel in which the cognitive message is decoded at both receivers. We derive the capacity for the…

Information Theory · Computer Science 2012-02-07 Stefano Rini , Carolin Huppert

We propose a novel characterization method of randomly branched polymers based on the geometrical property of such objects in confined spaces. The central idea is that randomly branched polymers exhibit passing/clogging transition across…

Soft Condensed Matter · Physics 2014-02-03 Takahiro Sakaue , Françoise Brochard-Wyart

Due to the short and bursty incoming messages, channel access activities in a wireless random access system are often fractional. The lack of frequent data support consequently makes it difficult for the receiver to estimate and track the…

Information Theory · Computer Science 2011-10-11 Zheng Wang , Jie Luo

The effect of inelastic scattering on quantum tunneling through a rectangular potential barrier, of length $L$, containing randomly distributed impurities, is considered. It is shown that, despite the fact that the inelastic transition…

Disordered Systems and Neural Networks · Physics 2007-05-23 Alex Levchenko

A fundamental problem in any communication system is: given a communication channel between a transmitter and a receiver, how many "independent" signals can be exchanged between them? Arbitrary communication channels that can be described…

Information Theory · Computer Science 2009-01-14 Ram Somaraju , Jochen Trumpf