225 search results - page 9 / 45 » Capacity Bounds for Sticky Channels |
IMA
2003
Springer
14 years 18 days 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...
ICT
2004
Springer
14 years 23 days ago
2004
Springer
— In this paper we determine bounds of the capacity region of a two-user multipleaccess channel with Rayleigh fading when neither the transmitters nor the receiver has channel st...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
—The capacity region of the finite-state multiple-access channel (FS-MAC) with feedback that may be an arbitrary timeinvariant function of the channel output samples is consider...
TIT
2011
13 years 2 months ago
2011
—A recent inner bound on the capacity region of the two-receiver discrete memoryless broadcast channel is shown to be equivalent to the Marton-Gelfand-Pinsker region. The proof m...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Abstract--We address the maximum attainable rate of fingerprinting codes under the marking assumption, studying lower and upper bounds on the value of the rate for various sizes of...