350 search results - page 5 / 70 » Lower and upper bounds on obtaining history independence |
COMSWARE
2007
IEEE
14 years 1 months ago
2007
IEEE
— Sequence design and resource allocation for a symbol-asynchronous chip-synchronous code division multiple access (CDMA) system is considered in this paper. A simple lower bound...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
We investigate the problem of secure communication over parallel relay channel in the presence of a passive eavesdropper. We consider a four terminal relay-eavesdropper channel wh...
STACS
2009
Springer
13 years 11 months ago
2009
Springer
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
TON
2010
13 years 1 months ago
2010
We consider a class of wireless networks with general interference constraints on the set of links that can be served simultaneously at any given time. We restrict the traffic to b...
GLOBECOM
2008
IEEE
13 years 7 months ago
2008
IEEE
In this paper, we investigate upper and lower bounds on the capacity of two-user fading broadcast channels where one of the users has a constant (non-fading) channel. We use the Co...