Sciweavers

30 search results - page 5 / 6
» Coding over an Erasure Channel with a Large Alphabet Size
Sort
View
STOC
2006
ACM
130views Algorithms» more  STOC 2006»
14 years 5 months ago
Explicit capacity-achieving list-decodable codes
For every 0 < R < 1 and > 0, we present an explicit construction of error-correcting codes of rate R that can be list decoded in polynomial time up to a fraction (1 - R ...
Venkatesan Guruswami, Atri Rudra
ICCCN
2007
IEEE
13 years 11 months ago
An FEC-based Reliable Data Transport Protocol for Underwater Sensor Networks
—In this paper, we investigate the reliable data transport problem in underwater sensor networks. Underwater sensor networks are significantly different from terrestrial sensor ...
Peng Xie, Jun-Hong Cui
ICALP
2000
Springer
13 years 8 months ago
Scalable Secure Storage when Half the System Is Faulty
In this paper, we provide a method to safely store a document in perhaps the most challenging settings, a highly decentralized replicated storage system where up to half of the st...
Noga Alon, Haim Kaplan, Michael Krivelevich, Dahli...
ADHOC
2010
195views more  ADHOC 2010»
13 years 5 months ago
SDRT: A reliable data transport protocol for underwater sensor networks
In this paper, we investigate the reliable data transport problem in underwater sensor networks. Underwater sensor networks are significantly different from terrestrial sensor net...
Peng Xie, Zhong Zhou, Zheng Peng, Jun-Hong Cui, Zh...
ICIP
2002
IEEE
14 years 6 months ago
Optimal protection assignment for scalable compressed images
This paper is concerned with the efficient transmission of scalable compressed images over lossy communication channels. Recent works have proposed several strategies for assignin...
Johnson Thie, David Taubman