1031 search results - page 4 / 207 » The single-serving channel capacity |
GLOBECOM
2008
IEEE
13 years 11 months ago
2008
IEEE
— We study the transmission of a stationary ergodic Gaussian source over a packet erasure channel, which is a composite channel with degraded states. A broadcast channel code can...
TIT
2008
13 years 5 months ago
2008
The capacity of sticky channels, a subclass of insertion channels where each symbol may be duplicated multiple times, is considered. The primary result is to provide nearly tight n...
TIT
2010
13 years 1 days ago
2010
The theory of Markov set-chains is applied to derive upper and lower bounds on the capacity of finite-state channels that are tighter than the classic bounds by Gallager. The new ...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
In this part, we consider the capacity analysis for wireless mobile systems with multiple antenna architectures. We apply the results of the first part to a commonly known baseban...
INFOCOM
2007
IEEE
13 years 11 months ago
2007
IEEE
— This paper argues for the need to address the issue of multi-channel network performance under constraints on channel switching. We present examples from emergent directions in...