374 search results - page 9 / 75 » On Communicating Automata with Bounded Channels |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
A sender wishes to broadcast a message of length n over an alphabet of size k to r users, where each user i, 1 i r should be able to receive one of possible mi messages. The cha...
GLOBECOM
2008
IEEE
14 years 1 months ago
2008
IEEE
— We use the idea of dependence balance [1] to obtain the first improvement over the cut-set bound for the discrete memoryless multiple access channel with noiseless feedback (M...
GLOBECOM
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—In this paper, we consider the Bayesian CramerRao bound (BCRB) for the dynamical estimation of multi-path Rayleigh channel complex gains in data-aided (DA) and non-dataa...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
— Non-linear amplitude distortion may be the key impairment in some practical multiple-input multipleoutput (MIMO) communications systems. However, there are only a few past inve...
TCC
2005
Springer
14 years 27 days ago
2005
Springer
We study the limitations of steganography when the sender is not using any properties of the underlying channel beyond its entropy and the ability to sample from it. On the negati...