Reed–Solomon codes are a classic family of error-correcting codes consisting of
evaluations of low-degree polynomials over a finite field on some sequence of distinct field …

In a seminal work, Goldreich, Micali and Wigderson (CRYPTO'86) demonstrated the wide
applicability of zero-knowledge proofs by constructing such a proof system for the NP …

We develop a new algorithm for the turnstile heavy hitters problem in general turnstile
streams, the EXPANDERSKETCH, which finds the approximate top-k items in a universe of …

Locally correctable codes (LCCs) and locally testable codes (LTCs) are error-correcting
codes that admit local algorithms for correction and detection of errors. Those algorithms are …

Existing proofs that deduce BPP= P from circuit lower bounds convert randomized
algorithms into deterministic algorithms with a large polynomial slowdown. We convert …

We show that Gallager's ensemble of Low-Density Parity Check (LDPC) codes achieves list-
decoding capacity with high probability. These are the first graph-based codes shown to …

We study codes that are list-decodable under insertions and deletions. Specifically, we
consider the setting where a codeword over some finite alphabet of size $ q $ may suffer …

Classical locally recoverable codes, which permit highly efficient recovery from localized
errors as well as global recovery from larger errors, provide some of the most useful codes …

We show that the tensor product of a high-rate globally list recoverable code is
(approximately) locally list recoverable. List recovery has been a useful building block in the …

A collision resistant hash (CRH) function is one that compresses its input, yet it is hard to find
a collision, ie a x_1 ≠ x_2 x 1≠ x 2 st h (x_1)= h (x_2) h (x 1)= h (x 2). Collision resistant …