English
Related papers

Related papers: Multipath Channels of Unbounded Capacity

200 papers

The mutual information of a discrete time memoryless Rayleigh fading channel is considered, where neither the transmitter nor the receiver has the knowledge of the channel state information except the fading statistics. We present the…

Information Theory · Computer Science 2007-07-13 Rasika Perera , Tony Pollock , Thushara Abhayapala

We derive the capacity region of the degraded broadcast channel (DBC) subject to the constraint that the communication is not detected by an adversary, the Warden. Our capacity result is in a computable form and numerical results show that…

Information Theory · Computer Science 2026-05-12 Yossef Steinberg , Michèle Wigger

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

In this paper we deal with a single-antenna discrete-time flat-fading channel. The fading process is assumed to be stationary for the duration of a single data block. From block to block the fading process is allowed to be non-stationary.…

Information Theory · Computer Science 2007-07-13 Thomas Zemen , Stefan M. Moser

We study the determination problem of the channel capacity for the discrete memoryless channels in the finite blocklength regime. We derive explicit lower and upper bounds of the capacity. We shall demonstrate that the information spectrum…

Information Theory · Computer Science 2019-04-11 Yasutada Oohama

This paper develops upper bounds on the end-to-end transmission capacity of multi-hop wireless networks. Potential source-destination paths are dynamically selected from a pool of randomly located relays, from which a closed-form lower…

Information Theory · Computer Science 2013-02-08 Yuxin Chen , Jeffrey G. Andrews

Many communication applications incorporate event-triggered behavior, where the conventional Shannon capacity may not effectively gauge performance. Consequently, we advocate for the concept of identification capacity as a more suitable…

Information Theory · Computer Science 2025-02-04 Ilya Vorobyev , Christian Deppe , Holger Boche

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

We introduce potential capacities of quantum channels in an operational way and provide upper bounds for these quantities, which quantify the ultimate limit of usefulness of a channel for a given task in the best possible context.…

Quantum Physics · Physics 2016-02-17 Andreas Winter , Dong Yang

Cognitive radio technology is an innovative radio design concept which aims to increase spectrum utilization by exploiting unused spectrum in dynamically changing environments. By extending previous results, we investigate the capacity…

Information Theory · Computer Science 2016-11-18 Himal A. Suraweera , Jason Gao , Peter J. Smith , Mansoor Shafi , Michael Faulkner

The optical fiber multiple-input multiple-output (MIMO) channel with intensity modulation and direct detection (IM/DD) per spatial path is treated. The spatial dimensions represent the multiple modes employed for transmission and the…

Information Theory · Computer Science 2022-01-28 Metodi P. Yankov , Francesco Da Ros , Søren Forchhammer , Lars Gruner-Nielsen

This paper considers an arbitrarily-varying fading channel consisting of one transmitter, one receiver and an arbitrarily varying adversary. The channel is assumed to have additive Gaussian noise and fast fading of the gain from the…

Information Theory · Computer Science 2021-06-15 Fatemeh Hosseinigoki , Oliver Kosut

An upper bound to the identification capacity of discrete memoryless wiretap channels is derived under the requirement of semantic effective secrecy, combining semantic secrecy and stealth constraints. A previously established lower bound…

Information Theory · Computer Science 2023-06-27 Johannes Rosenberger , Abdalla Ibrahim , Boulat A. Bash , Christian Deppe , Roberto Ferrara , Uzi Pereg

Classical multiuser information theory studies the fundamental limits of models with a fixed (often small) number of users as the coding blocklength goes to infinity. Motivated by emerging systems with a massive number of users, this paper…

Information Theory · Computer Science 2014-05-06 Tsung-Yi Chen , Xu Chen , Dongning Guo

Effective capacity, which provides the maximum constant arrival rate that a given service process can support while satisfying statistical delay constraints, is analyzed in a multiuser scenario. In particular, the effective capacity region…

Information Theory · Computer Science 2010-09-17 Deli Qiao , Mustafa Cenk Gursoy , Senem Velipasalar

The identification capacity region of the compound broadcast channel is determined under an average error criterion, where the sender has no channel state information. We give single-letter identification capacity formulas for discrete…

Information Theory · Computer Science 2021-12-03 Johannes Rosenberger , Uzi Pereg , Christian Deppe

The linear shift deterministic Y-channel is studied. That is, we have three users and one relay, where each user wishes to broadcast one message to each other user via the relay, resulting in a multi-way relaying setup. The cut-set bounds…

Information Theory · Computer Science 2015-03-19 Anas Chaaban , Aydin Sezgin

Correlated scattering occurs naturally in frequency-selective fading channels and its impact on the performance needs to be understood. In particular, we answer the question whether the uncorrelated scattering model leads to an optimistic…

Information Theory · Computer Science 2009-01-19 Eduard Jorswieck , Martin Mittelbach

The capacity of classical channels is convex. This is not the case for the quantum capacity of a channel: the capacity of a mixture of different quantum channels exceeds the mixture of the individual capacities and thus is non-convex. Here…

Quantum Physics · Physics 2016-10-26 David Elkouss , Sergii Strelchuk

We calculate the entanglement assisted capacity of a multimode bosonic channel with loss. As long as the efficiency of the channel is above 50%, the superdense coding effect can be used to transmit more bits than those that can be stored in…

Quantum Physics · Physics 2009-11-10 Vittorio Giovannetti , Seth Lloyd , Lorenzo Maccone , Peter W. Shor
‹ Prev 1 4 5 6 7 8 10 Next ›