4 search results - page 1 / 1 » The Common Randomness Capacity of a Pair of Independent Disc... |
TIT
1998
13 years 4 months ago
1998
—We study the following problem: two agents Alice and Bob are connected to each other by independent discrete memoryless channels. They wish to generate common randomness, i.e., ...
GLOBECOM
2006
IEEE
13 years 11 months ago
2006
IEEE
— This paper introduces broadcasting relay nodes for orthogonal multiuser channels. The underlying idea is that a single relay node is shared by multiple source-destination pairs...
TIT
2002
13 years 4 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
2007
Springer
13 years 4 months ago
2007
Springer
An analysis of steganographic systems subject to the following perfect undetectability condition is presented in this paper. Following embedding of the message into the covertext,...