25 search results - page 3 / 5 » Capacity of General Discrete Noiseless Channels |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
We study the best known general inner bound[1] and outer bound[2] for the capacity region of the two user discrete memory less channel. We prove that a seemingly stronger outer bou...
CORR
2011
Springer
12 years 8 months ago
2011
Springer
A single-letter achievable rate region is proposed for the two-receiver discrete memoryless broadcast channel with noiseless or noisy feedback. The coding strategy involves block-...
TIT
2002
13 years 5 months ago
2002
The entanglement-assisted classical capacity of a noisy quantum channel ( ) is the amount of information per channel use that can be sent over the channel in the limit of many uses...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
In this correspondence, the multiple access channel (MAC) with channel state is analyzed in a scenario where a) the channel state is known non-causally to the transmitters and b) t...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
— We consider perfect secret key generation for a “pairwise independent network” model in which every pair of terminals share a random binary string, with the strings shared ...