In their highly influential paper, Ben-Sasson, Goldreich, Harsha, Sudan, and Vadhan (STOC
2004) introduced the notion of a relaxed locally decodable code (RLDC). Similarly to a …

A primitive k-batch code encodes a string x of length n into a stringy of length N, such that
each multiset of k symbols from x has k mutually disjoint recovering sets from y. In this paper …

Guo, Kopparty and Sudan have initiated the study of error-correcting codes derived by lifting
of affine-invariant codes. Lifted Reed-Solomon (RS) codes are defined as the evaluation of …

Lifted Reed-Solomon and multiplicity codes are classes of codes, constructed from specific
sets of-variate polynomials. These codes allow for the design of high-rate codes that can …

Batch codes are a useful notion of locality for error correcting codes, originally introduced in
the context of distributed storage and cryptography. Many constructions of batch codes have …

We define wedge-lifted codes, a variant of lifted codes, and we study their locality properties.
We show that (taking the trace of) wedge-lifted codes yields binary codes with the t-disjoint …

Lifted Reed-Solomon codes and multiplicity codes are two classes of evaluation codes that
allow for the design of high-rate codes that can recover every codeword or information …

Rate Amplification and Query-Efficient Distance Amplification for Linear LCC and LDC Page 1
Rate Amplification and Query-Efficient Distance Amplification for Linear LCC and LDC Gil …

Low degree Reed-Muller codes are known to satisfy local decoding properties which find
applications in private information retrieval (PIR) protocols, for instance. However, their …

This work investigates different concepts related distributed storage, starting from codes with
locality properties, such as maximally recoverable codes for grid-like topologies …