Sciweavers

437 search results - page 48 / 88
» Randomized Lattice Decoding
Sort
View
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
15 years 12 months ago
Better extractors for better codes?
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
Venkatesan Guruswami
INFOCOM
2011
IEEE
14 years 3 months ago
SigSag: Iterative detection through soft message-passing
—The multiple-access framework of ZigZag decoding [1] is a useful technique for combating interference via multiple repeated transmissions, and is known to be compatible with dis...
Arash Saber Tehrani, Alexandros G. Dimakis, Michae...
94
Voted
GLOBECOM
2010
IEEE
14 years 9 months ago
Compressive Data Persistence in Large-Scale Wireless Sensor Networks
This paper considers a large-scale wireless sensor network where sensor readings are occasionally collected by a mobile sink, and sensor nodes are responsible for temporarily stori...
Mu Lin, Chong Luo, Feng Liu, Feng Wu
DCC
2005
IEEE
15 years 1 months ago
On the Performance of Linear Slepian-Wolf Codes for Correlated Stationary Memoryless Sources
We derive an upper bound on the average MAP decoding error probability of random linear SW codes for arbitrary correlated stationary memoryless sources defined on Galois fields....
Shengtian Yang, Peiliang Qiu
ICIP
2005
IEEE
15 years 5 months ago
Low complexity resolution progressive image coding algorithm: progres (progressive resolution decompression)
A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm avoids the multiple passes of bit-plane coding for speed impro...
Yushin Cho, William A. Pearlman, Amir Said