Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > STEVE UURTAMO:
All reports by Author steve uurtamo:

TR11-080 | 11th May 2011
mohammad iftekhar husain, steve ko, Atri Rudra, steve uurtamo

Storage Enforcement with Kolmogorov Complexity and List Decoding

We consider the following problem that arises in outsourced storage: a user stores her data $x$ on a remote server but wants to audit the server at some later point to make sure it actually did store $x$. The goal is to design a (randomized) verification protocol that has the ... more >>>


TR10-007 | 12th January 2010
Atri Rudra, steve uurtamo

Two Theorems in List Decoding

We prove the following results concerning the list decoding of error-correcting codes:

We show that for any code with a relative distance of $\delta$
(over a large enough alphabet), the
following result holds for random errors: With high probability,
for a $\rho\le \delta -\eps$ fraction of random errors (for any ... more >>>




ISSN 1433-8092 | Imprint