English
Related papers

Related papers: Ergodic Layered Erasure One-Sided Interference Cha…

200 papers

This paper studies the capacity of single-source single-sink noiseless networks under adversarial or arbitrary errors on no more than z edges. Unlike prior papers, which assume equal capacities on all links, arbitrary link capacities are…

Information Theory · Computer Science 2010-11-18 Sukwon Kim , Tracey Ho , Michelle Effros , Amir Salman Avestimehr

An inner bound to the capacity region of a class of deterministic interference channels with three user pairs is presented. The key idea is to simultaneously decode the combined interference signal and the intended message at each receiver.…

Information Theory · Computer Science 2015-03-13 Bernd Bandemer , Abbas El Gamal

In this paper, the delay limited secrecy capacity of the flat fading channel is investigated under two different assumptions on the available transmitter channel state information (CSI). The first scenario assumes perfect prior knowledge of…

Information Theory · Computer Science 2016-11-15 Karim Khalil , Moustafa Youssef , O. Ozan Koyluoglu , Hesham El Gamal

This paper characterizes the capacity of a class of modulo additive noise relay channels, in which the relay observes a corrupted version of the noise and has a separate channel to the destination. The capacity is shown to be strictly below…

Information Theory · Computer Science 2016-09-08 Marko Aleksic , Peyman Razaghi , Wei Yu

Upper bounds on the capacity of vector Gaussian channels affected by fading are derived under peak amplitude constraints at the input. The focus is on constraint regions that can be decomposed in a Cartesian product of sub-regions. This…

Information Theory · Computer Science 2022-07-05 Antonino Favano , Marco Ferrari , Maurizio Magarini , Luca Barletta

The ergodic capacity of underlay cognitive (secondary) dual-hop relaying systems is analytically investigated. Specifically, the amplify-and-forward transmission protocol is considered, while the received signals undergo multipath fading…

Information Theory · Computer Science 2015-09-01 Nikolaos I. Miridakis

Channel state information (CSI) at the transmitter is of importance to the performance of physical layer security based on multi-antenna networks. Specifically, CSI is not only beneficial to improve the capacity of the legitimate channel,…

Information Theory · Computer Science 2016-11-17 Xiaoming Chen , Rui Yin

Shallow supervised 1-hidden layer neural networks have a number of favorable properties that make them easier to interpret, analyze, and optimize than their deep counterparts, but lack their representational power. Here we use 1-hidden…

Machine Learning · Computer Science 2019-04-24 Eugene Belilovsky , Michael Eickenberg , Edouard Oyallon

The correspondence cited in the title [1] derived ergodic capacity of the coherent multiple-input multiple-output (MIMO) channel in independent and identically distributed (IID) Rayleigh fading. While the theoretical results are correct,…

Information Theory · Computer Science 2021-12-28 Kamal Singh , Chandradeep Singh

Using Gaussian inputs and treating interference as noise at the receivers has recently been shown to be sum capacity achieving for the two-user single-input single-output (SISO) Gaussian interference channel in a low interference regime,…

Information Theory · Computer Science 2010-10-25 V. Sreekanth Annapureddy , Venugopal V. Veeravalli

Communication channels are said to be underspread if their coherence time is greater than their delay spread. In such cases it can be shown that in the infinite bandwidth limit the information capacity tends to that of a channel with…

Information Theory · Computer Science 2014-06-24 Steven Herbert , Ian Wassell , Tian-Hong Loh

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

We present an upper bound for the quantum channel capacity that is both additive and convex. Our bound can be interpreted as the capacity of a channel for high-fidelity quantum communication when assisted by a family of channels that have…

Quantum Physics · Physics 2008-08-28 Graeme Smith , John A. Smolin , Andreas Winter

This paper shows how the application of stochastic geometry to the analysis of wireless networks is greatly facilitated by (i) a clear separation of time scales, (ii) the abstraction of small-scale effects via ergodicity, and (iii) an…

Information Theory · Computer Science 2017-08-04 Geordie George , Ratheesh K. Mungara , Angel Lozano , Martin Haenggi

In this work, we investigate the problem of secure broadcasting over block-fading wiretap channels with limited channel knowledge at the transmitter. More particularly, we analyze the effect of having a finite rate feedback on the…

Information Theory · Computer Science 2020-04-22 Amal Hyadi , Zouheir Rezki , Mohamed-Slim Alouini

We evaluate the information capacities of a lossy bosonic channel with correlated noise. The model generalizes the one recently discussed in [Phys. Rev. A 77, 052324 (2008)], where memory effects come from the interaction with correlated…

Quantum Physics · Physics 2009-10-13 Cosmo Lupo , Oleg V. Pilyavets , Stefano Mancini

The capacity of a class of Interference Relay Channels (IRC) -the Injective Semideterministic IRC where the relay can only observe one of the sources- is investigated. We first derive a novel outer bound and two inner bounds which are based…

Information Theory · Computer Science 2016-09-28 Germán Bassi , Pablo Piantanida , Sheng Yang

Characterizing the capacity region of multi-source wireless relay networks is one of the fundamental issues in network information theory. The problem is, however, quite challenging due to inter-user interference when there exist multiple…

Information Theory · Computer Science 2013-10-29 Sang-Woon Jeon , Sae-Young Chung

This paper deals with the secrecy capacity of the radio channel in interference-limited regime. We assume that interferers are uniformly scattered over the network area according to a Point Poisson Process and the channel model consists of…

Information Theory · Computer Science 2015-06-23 Hirley Alves , Carlos H. M. de Lima , Pedro. H. J. Nardelli , Richard Demo Souza , Matti Latva-aho

Rodrigo de Miguel et al 2007 J. Phys. A: Math. Theor. 40 5241-5260: A noisy vector channel operating under a strict complexity constraint at the receiver is introduced. According to this constraint, detected bits, obtained by performing…

Information Theory · Computer Science 2009-11-11 Rodrigo de Miguel , Ori Shental , Ralf R. Muller , Ido Kanter