Sciweavers

1063 search results - page 9 / 213
» Capacity of steganographic channels
Sort
View
TIT
2008
84views more  TIT 2008»
13 years 7 months ago
Capacity Bounds for Sticky Channels
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...
Michael Mitzenmacher
CORR
2008
Springer
140views Education» more  CORR 2008»
13 years 6 months ago
Steganography of VoIP streams
The paper concerns available steganographic techniques that can be used for creating covert channels for VoIP (Voice over Internet Protocol) streams. Apart from characterizing exis...
Wojciech Mazurczyk, Krzysztof Szczypiorski
TIT
2010
76views Education» more  TIT 2010»
13 years 2 months ago
Tighter bounds on the capacity of finite-state channels via Markov set-chains
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 ...
Jun Chen, Haim H. Permuter, Tsachy Weissman
CORR
2004
Springer
140views Education» more  CORR 2004»
13 years 7 months ago
Capacity Analysis for Continuous Alphabet Channels with Side Information, Part II: MIMO Channels
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...
Majid Fozunbal, Steven W. McLaughlin, Ronald W. Sc...
INFOCOM
2007
IEEE
14 years 1 months ago
Connectivity and Capacity of Multi-Channel Wireless Networks with Channel Switching Constraints
— 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...
Vartika Bhandari, Nitin H. Vaidya