168 search results - page 8 / 34 » Lower Bounds for Distributed Coin-Flipping and Randomized Co... |
107
click to vote
CORR
2007
Springer
14 years 11 months ago
2007
Springer
—A network of n communication links, operating over a shared wireless channel, is considered. Fading is assumed to be the dominant factor affecting the strength of the channels b...
111
click to vote
TIT
2010
14 years 6 months ago
2010
Upper and lower bounds are obtained for the joint entropy of a collection of random variables in terms of an arbitrary collection of subset joint entropies. These inequalities gene...
EUROPAR
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We address the call control problem in wireless cellular networks that utilize Frequency Division Multiplexing (FDM) technology. In such networks, many users within the s...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
Universally achievable error exponents pertaining to certain families of channels (most notably, discrete memoryless channels (DMC’s)), and various ensembles of random codes, ar...
128
click to vote
SPAA
1994
ACM
15 years 3 months ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...