Sciweavers

59 search results - page 2 / 12
» One-Shot Capacity of Discrete Channels
Sort
View
IMA
2003
Springer
125views Cryptology» more  IMA 2003»
13 years 11 months ago
Commitment Capacity of Discrete Memoryless Channels
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...
Andreas Winter, Anderson C. A. Nascimento, Hideki ...
TIT
1998
89views more  TIT 1998»
13 years 5 months ago
The Common Randomness Capacity of a Pair of Independent Discrete Memoryless Channels
—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., ...
Sivarama Venkatesan, Venkat Anantharam
CORR
2008
Springer
112views Education» more  CORR 2008»
13 years 6 months ago
Capacity of General Discrete Noiseless Channels
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 discre...
Georg Böcherer, Valdemar Cardoso da Rocha Jr....
CORR
2008
Springer
119views Education» more  CORR 2008»
13 years 6 months ago
Capacity of the Discrete-Time AWGN Channel Under Output Quantization
We investigate the limits of communication over the discrete-time Additive White Gaussian Noise (AWGN) channel, when the channel output is quantized using a small number of bits. W...
Jaspreet Singh, Onkar Dabeer, Upamanyu Madhow
ICC
2007
IEEE
150views Communications» more  ICC 2007»
14 years 10 days ago
Capacity-Achieving Discrete Signaling over Additive Noise Channels
— Discrete input distributions are capacity-achieving for a variety of noise distributions whenever the input is subject to peak power or other bounding constraints. In this pape...
Anke Feiten, Rudolf Mathar