Sciweavers

495 search results - page 66 / 99
» Capacity of Non-Malleable Codes
Sort
View
STOC
1997
ACM
257views Algorithms» more  STOC 1997»
13 years 12 months ago
Practical Loss-Resilient Codes
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
TCOM
2008
192views more  TCOM 2008»
13 years 7 months ago
Joint source coding, routing and power allocation in wireless sensor networks
This paper proposes a cross-layer optimization framework for the wireless sensor networks. In a wireless sensor network, each sensor makes a local observation of the underlying phy...
Jun Yuan, Wei Yu
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
ICDCSW
2008
IEEE
14 years 2 months ago
Fast Link Assessment in Wireless Mesh Networks by Using Non-Constant Weight Code
Abstract— The wireless mesh network is experiencing tremendous growth with the standardization of IEEE 802.11 and IEEE 802.16 technologies. Compared to its wired counterpart, the...
Ravi Nelavelli, Rajesh Prasad, Hongyi Wu
ECMAST
1998
Springer
118views Multimedia» more  ECMAST 1998»
13 years 12 months ago
Error-Robustness of Polar Contour-Coding
For communication using digital video, compression is mandatory because of the high bit-rate requiring a large bandwidth or storage capacity. Recent developments as well as upcomi...
Frank H. P. Spaan, Reginald L. Lagendijk, Jan Biem...