24 citations · 28 across the 2 of their papers we have counts for
3 papers
cs.DS2013★ 24 cited
L2/L2-foreach sparse recovery with low risk
Anna C. Gilbert, Hung Q. Ngo, Ely Porat +2
In this paper, we consider the "foreach" sparse recovery problem with failure probability . The goal of which is to design a distribution over matrices and a de…
cs.CC2011★ 4 cited
Storage Enforcement with Kolmogorov Complexity and List Decoding
Mohammad Iftekhar Husain, Steve Ko, Atri Rudra +1
We consider the following problem that arises in outsourced storage: a user stores her data on a remote server but wants to audit the server at some later point to make sure it…
cs.IT2005
Explicit Codes Achieving List Decoding Capacity: Error-correction with Optimal Redundancy
Venkatesan Guruswami, Atri Rudra
We present error-correcting codes that achieve the information-theoretically best possible trade-off between the rate and error-correction radius. Specifically, for every $0 < R <…