English
Related papers

Related papers: Finite-Time Capacity: Making Exceed-Shannon Possib…

200 papers

Quantum communication channels differ from their classical counterparts because their capacities can be superadditive. The principle of monogamy of entanglement suggests that superadditive improvements in the transmission capacity of a…

Quantum Physics · Physics 2025-11-06 Satvik Singh , Sergii Strelchuk

Molecular communication is set to play an important role in the design of complex biological and chemical systems. An important class of molecular communication systems is based on the timing channel, where information is encoded in the…

Information Theory · Computer Science 2014-10-22 Malcolm Egan , Yansha Deng , Maged Elkashlan , Trung Q. Duong

This paper concerns the capacity of the discrete noiseless channel introduced by Shannon. A sufficient condition is given for the capacity to be well-defined. For a general discrete noiseless channel allowing non-integer valued symbol…

Information Theory · Computer Science 2010-06-11 Georg Bocherer , Valdemar Cardoso da Rocha Junior , Cecilio Pimentel

The capacity of a deterministic multiple-input multiple-output (MIMO) channel under the peak and average power constraints is investigated. For the identity channel matrix, the approach of Shamai et al. is generalized to the higher…

Information Theory · Computer Science 2016-09-29 Borzoo Rassouli , Bruno Clerckx

We derive upper bounds on the rate of transmission of classical information over quantum channels by block codes with a given blocklength and error probability, for both entanglement-assisted and unassisted codes, in terms of a unifying…

Quantum Physics · Physics 2016-01-01 William Matthews , Stephanie Wehner

We consider a peak-power-limited single-antenna block-stationary Gaussian fading channel where neither the transmitter nor the receiver knows the channel state information, but both know the channel statistics. This model subsumes most…

Information Theory · Computer Science 2016-11-17 Jun Chen , Venugopal V. Veeravalli

Recently the theory of communication developed by Shannon has been extended to the quantum realm by exploiting the rules of quantum theory. This latter stems on complex vector spaces. However complex (as well as real) numbers are just…

Information Theory · Computer Science 2018-04-23 Samad Khabbazi Oskouei , Stefano Mancini

The traditional notion of capacity studied in the context of memoryless network communication builds on the concept of block-codes and requires that, for sufficiently large blocklength n, all receiver nodes simultaneously decode their…

Information Theory · Computer Science 2021-02-01 Michael Langberg , Michelle Effros

Recently, communication systems that are both spectrum and energy efficient have attracted significant attention. Different from the existing research, we investigate the throughput and energy efficiency of a general class of multiple-input…

Information Theory · Computer Science 2017-12-05 Marwan Hammouda , Sami Akın , M. Cenk Gursoy , Jürgen Peissig

In this paper, capacity bounds for the two-user Interference Channel (IC) with cooperative receivers via conferencing links of finite capacities is investigated. The capacity results known for this communication scenario are limited to a…

Information Theory · Computer Science 2015-12-17 Reza K. Farsani , Amir K. Khandani

Energy harvesting sensor nodes are gaining popularity due to their ability to improve the network life time and are becoming a preferred choice supporting 'green communication'. In this paper we focus on communicating reliably over an AWGN…

Information Theory · Computer Science 2012-12-14 Rajesh Ramachandran , Vinod Sharma , Pramod Viswanath

We consider an additive Gaussian channel with additive Gaussian noise feedback. We derive an upper bound on the n-block capacity (defined by Cover [1]). It is shown that this upper bound can be obtained by solving a convex optimization…

Information Theory · Computer Science 2015-03-19 Chong Li , Nicola Elia

The two-user computation broadcast problem is introduced as the setting where User $1$ wants message $W_1$ and has side-information $W_1'$, User $2$ wants message $W_2$ and has side-information $W_2'$, and $(W_1, W_1', W_2, W_2')$ may have…

Information Theory · Computer Science 2019-03-19 Hua Sun , Syed A. Jafar

Coding theorems in quantum Shannon theory express the ultimate rates at which a sender can transmit information over a noisy quantum channel. More often than not, the known formulas expressing these transmission rates are intractable,…

Quantum Physics · Physics 2010-06-15 Kamil Bradler , Patrick Hayden , Dave Touchette , Mark M. Wilde

This paper investigates the capacity of a wireless two way relay channel in which two end nodes exchange information via a relay node. The capacity is defined in the information-theoretic sense as the maximum information exchange rate…

Information Theory · Computer Science 2008-04-22 Zhang Shengli , Soung Chang Liew

Accurate fading characterization and channel capacity determination are of paramount importance in both conventional and emerging communication systems. The present work addresses the nonlinearity of the propagation medium and its effects…

Information Theory · Computer Science 2016-12-30 Paschalis C. Sofotasios , Sami Muhaidat , Mikko Valkama , Mounir Ghogho , George K. Karagiannidis

We analyze deterministic message identification via channels with non-discrete additive white noise and with a noiseless feedback link under both average power and peak power constraints. The identification task is part of Post Shannon…

Information Theory · Computer Science 2022-02-18 Moritz Wiese , Wafa Labidi , Christian Deppe , Holger Boche

The capacity of a channel is known to be equivalent to the highest rate at which it can generate entanglement. Analogous to entanglement, the notion of a causality measure characterises the temporal aspect of quantum correlations. Despite…

Quantum Physics · Physics 2020-02-24 Robert Pisarczyk , Zhikuan Zhao , Yingkai Ouyang , Vlatko Vedral , Joseph F. Fitzsimons

In "Reliable Communication in the Absence of a Common Clock" (Yeung et al., 2009), the authors introduce general run-length sets, which form a class of constrained systems that permit run-lengths from a countably infinite set. For a…

Information Theory · Computer Science 2010-01-14 Georg Böcherer , Rudolf Mathar , Valdemar Cardoso da Rocha Junior , Cecilio Pimentel

We study non-asymptotic fundamental limits for transmitting classical information over memoryless quantum channels, i.e. we investigate the amount of classical information that can be transmitted when a quantum channel is used a finite…

Quantum Physics · Physics 2015-05-20 Marco Tomamichel , Vincent Y. F. Tan
‹ Prev 1 4 5 6 7 8 10 Next ›