Sciweavers

1063 search results - page 179 / 213
» Capacity of steganographic channels
Sort
View
TIT
2008
94views more  TIT 2008»
14 years 11 months ago
Why Do Block Length and Delay Behave Differently if Feedback Is Present?
Abstract--For output-symmetric discrete memoryless channels (DMCs) at even moderately high rates, fixed-block-length communication systems show no improvements in their error expon...
Anant Sahai
CORR
2004
Springer
144views Education» more  CORR 2004»
14 years 11 months ago
Iterative Quantization Using Codes On Graphs
We study codes on graphs combined with an iterative message passing algorithm for quantization. Specifically, we consider the binary erasure quantization (BEQ) problem which is th...
Emin Martinian, Jonathan S. Yedidia
DKE
2007
156views more  DKE 2007»
14 years 11 months ago
Efficient index and data allocation for wireless broadcast services
The periodic broadcasting of frequently requested data can reduce the workload of uplink channels and improve data access for users in a wireless network. Since mobile devices hav...
Shou-Chih Lo, Arbee L. P. Chen
COR
2008
129views more  COR 2008»
14 years 11 months ago
Queues in DOCSIS cable modem networks
In this paper we determine the optimal fraction c of the uplink channel capacity that should be dedicated to the contention channel in a DOCSIS cable network in order to minimize ...
Joke Lambert, Benny Van Houdt, Chris Blondia
TMC
2010
182views more  TMC 2010»
14 years 10 months ago
Rate Adaptation in Congested Wireless Networks through Real-Time Measurements
—Rate adaptation is a critical component that impacts the performance of IEEE 802.11 wireless networks. In congested networks, traditional rate adaptation algorithms have been sh...
Prashanth Aravinda Kumar Acharya, Ashish Sharma, E...