Sciweavers

18 search results - page 4 / 4
» Sparse Random Linear Codes are Locally Decodable and Testabl...
Sort
View
STOC
2009
ACM
159views Algorithms» more  STOC 2009»
14 years 6 months ago
Message passing algorithms and improved LP decoding
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
Sanjeev Arora, Constantinos Daskalakis, David Steu...
ICIP
2010
IEEE
13 years 3 months ago
Deterministic structured network coding for WWAN video broadcast with cooperative peer-to-peer repair
Recent research has exploited the multi-homing property (one terminal with multiple network interfaces) of modern devices to improve communication performance in wireless networks...
Xin Liu, Gene Cheung, Chen-Nee Chuah
TIT
2010
128views Education» more  TIT 2010»
13 years 11 days ago
Shannon-theoretic limits on noisy compressive sampling
In this paper, we study the number of measurements required to recover a sparse signal in M with L nonzero coefficients from compressed samples in the presence of noise. We conside...
Mehmet Akçakaya, Vahid Tarokh