A locally testable code (LTC) is an error correcting code that has a property-tester. The tester
reads q bits that are randomly chosen, and rejects words with probability proportional to their …

Abstract The family of Reed-Solomon (RS) codes plays a prominent role in the construction
of quasilinear probabilistically checkable proofs (PCPs) and interactive oracle proofs (IOPs) …

We prove that a binary linear code of block length n that is locally correctable with 3 queries
against a fraction δ>0 of adversarial errors must have dimension at most o_δ(>\log^2n. log …

A locally testable code (LTC) is an error correcting code with a property tester. The tester
tests if a word is a codeword by reading constant random bits and rejects the word with …

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 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 …

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 …

Abstract Recently, Kumar and Mon reached a significant milestone by constructing
asymptotically good relaxed locally correctable codes (RLCCs) with poly-logarithmic query …

In this work, we show new and improved error-correcting properties of folded Reed-Solomon
codes and multiplicity codes. Both of these families of codes are based on polynomials over …

The Gilbert-Varshamov bound (non-constructively) establishes the existence of binary codes
of distance 1/2-ε and rate Ω(ε^2) (where an upper bound of O(ε^2\log(1/ε)) is known). Ta …