1031 search results - page 90 / 207 » The single-serving channel capacity |
WIOPT
2006
IEEE
15 years 5 months ago
2006
IEEE
Abstract— In a dense multi-hop network of mobile nodes capable of applying adaptive power control, we consider the problem of finding the optimal hop distance that maximizes a c...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
The problem of maximizing the average rate in a multicast network subject to a coverage constraint (minimum quality of service) is studied. Assuming the channel state information ...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
— A linear mesh network is considered in which a single user per cell communicates to a local base station via a dedicated relay (two-hop communication). Exploiting the possibly ...
STOC
1994
ACM
15 years 3 months ago
1994
ACM
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
The sphere-packing bound Esp(R) bounds the reliability function for fixed-length block-codes. For symmetric channels, it remains a valid bound even when strictly causal noiseless ...