374 search results - page 28 / 75 » On Communicating Automata with Bounded Channels |
177
Voted
CORR
2006
Springer
15 years 6 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...
180
click to vote
VTC
2006
IEEE
16 years 3 days ago
2006
IEEE
In this paper, we present an asymptotical analysis of channel capacity of Bell labs layered space-time (BLAST) architectures based on a zero-forcing (ZF) criterion in the sense of...
138
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract--A peak-power-limited single-antenna block-stationary Gaussian fading channel is studied, where neither the transmitter nor the receiver knows the channel state informatio...
165
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Motivated by random linear network coding, we study the communication through channels, called linear operator channels (LOCs), that perform linear operation over finite fields. Fo...
183
click to vote
TCS
2012
14 years 1 months ago
2012
In Sensor Networks, the lack of topology information and the availability of only one communication channel has led research work to the use of randomization to deal with collisio...