Sciweavers

117 search results - page 16 / 24
» Coding Theorems on the Threshold Scheme for a General Source
Sort
View
TIT
2008
98views more  TIT 2008»
13 years 7 months ago
Multiuser Successive Refinement and Multiple Description Coding
We consider the multiuser successive refinement (MSR) problem, where the users are connected to a central server via links with different noiseless capacities, and each user wishes...
Chao Tian, Jun Chen, Suhas N. Diggavi
CN
2008
84views more  CN 2008»
13 years 7 months ago
A router-based technique to mitigate reduction of quality (RoQ) attacks
We propose a router-based technique to mitigate the stealthy reduction of quality (RoQ) attacks at the routers in the Internet. The RoQ attacks have been shown to impair the QoS s...
Amey Shevtekar, Nirwan Ansari
JSAC
2007
102views more  JSAC 2007»
13 years 7 months ago
Partially-coherent distributed space-time codes with differential encoder and decoder
Abstract— Distributed space-time coding is a means of achieving diversity through cooperative communication in a wireless relay network. In this paper, we consider a transmission...
T. Kiran, B. Sundar Rajan
TIT
2010
138views Education» more  TIT 2010»
13 years 2 months ago
Functional compression through graph coloring
Motivated by applications to sensor networks and privacy preserving databases, we consider the problem of functional compression. The objective is to separately compress possibly c...
Vishal Doshi, Devavrat Shah, Muriel Médard,...
CORR
2008
Springer
87views Education» more  CORR 2008»
13 years 7 months ago
The Rate Loss of Single-Letter Characterization: The "Dirty" Multiple Access Channel
For general memoryless systems, the typical information theoretic solution - when exists - has a "single-letter" form. This reflects the fact that optimum performance ca...
Tal Philosof, Ram Zamir