Skip to search formSkip to main contentSkip to account menu

Classical capacity

In quantum information theory, the classical capacity of a quantum channel is the maximum rate at which classical data can be sent over it error-free… 
Wikipedia (opens in a new tab)

Related topics

Related topics

9 relations
Amplitude damping channelEntanglement-assisted classical capacityNoisy-storage modelPOVM

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Optimizing the fundamental limits for quantum and private communication
The quantum capacity of a noisy quantum channel determines the maximal rate at which we can code reliably over asymptotically… 
2014
2014
qu an tph ] 2 1 A ug 2 01 4 Unbounded number of channel uses are required to see quantum capacity
  • 2014
  • Corpus ID: 53552324
Toby Cubitt, David Elkouss, William Matthews, 3 Maris Ozols, David Pérez-Garćıa, and Sergii Strelchuk Department of Applied… 
2014
2014
Proving and disproving information inequalities
Proving an information inequality is a crucial step in establishing the converse results in coding theorems. However, an… 
2011
2011
Structured interference-mitigation in two-hop networks
We consider two-hop S-R-D Gaussian networks with a source (S), a relay (R) and a destination (D), some of which experience… 
2009
2009
Classical capacity of quantum channels with memory
We investigate the classical capacity of two quantum channels with memory: a periodic channel with depolarizing channel branches… 
2009
2009
Two lossy source coding problems with causal side-information
Single-letter characterisations of the admissible rate regions of the Gu-Effros two-hop network and the Gray-Wyner network with… 
2007
2007
Achievable Region for Multiterminal Source Coding with Lossless Decoding in All Sources Except One
In this paper, we consider a class of multiterminal source coding problems, where all sources, except one, are reconstructed… 
2005
2005
General theory of information transfer
  • R. Ahlswede
  • Electron. Notes Discret. Math.
  • 2005
  • Corpus ID: 207552657
2004
2004
Multiple-user quantum optical communication
Thesis Supervisor: Jeffrey H. Shapiro Title: Julius A. Stratton Professor of Electrical Engineering 
1970
1970
A coding theorem for isols
In [1] it is shown that for every sequence x = 〈xn : n ∈ ω〉 ∈ Xω Λ there is an isol xω (essentially an immunized product) such… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)