Locally decodable codes are error-correcting codes that admit efficient decoding algorithms;
any bit of the original message can be recovered by looking at only a small number 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 …

We study the list-decodability of multiplicity codes. These codes, which are based on
evaluations of high-degree polynomials and their derivatives, have rate approaching 1 while …

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 …

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 …

In error-correcting codes, locality refers to several different ways of quantifying how easily a
small amount of information can be recovered from encoded data. In this work, we study a …

Consider a large database of n data items that need to be stored using m servers. We study
how to encode information so that a large number k of read requests can be performed in …

We show that expander codes, when properly instantiated, are high-rate list recoverable
codes with linear-time list recovery algorithms. List recoverable codes have applications to …

Since the concept of locally decodable codes was introduced by Katz and Trevisan in 2000
[11], it is well-known that information theoretically secure private information retrieval …