38 search results - page 1 / 8 » Commitment Capacity of Discrete Memoryless Channels |
IMA
2003
Springer
13 years 10 months ago
2003
Springer
In extension of the bit commitment task and following work initiated by Crépeau and Kilian, we introduce and solve the problem of characterising the optimal rate at which a discr...
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., ...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
Classically, communication systems are designed assuming perfect channel state information at the receiver and/or transmitter. However, in many practical situations, only an estim...
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
2006
Springer
13 years 4 months ago
2006
Springer
An outer bound to the capacity region of the two-receiver discrete memoryless broadcast channel is given. The outer bound is tight for all cases where the capacity region is known....