In a data-driven society, individuals and companies encounter numerous situations where
private information is an important resource. How can parties handle confidential data if they …

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 …

We prove conditional near-quadratic running time lower bounds for approximate
Bichromatic Closest Pair with Euclidean, Manhattan, Hamming, or edit distance. Specifically …

We give a randomized reduction for the Rank Syndrome Decoding problem and Rank
Minimum Distance problem for rank codes over extension fields. Our results are based on …

In a recent paper, Brakensiek, Gopi and Makam introduced higher order MDS codes as a
generalization of MDS codes. An order-ℓ MDS code, denoted by MDS (ℓ), has the property …

The recently-emerging field of higher order MDS codes has sought to unify a number of
concepts in coding theory. Such areas captured by higher order MDS codes include …

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 give a complete answer to the following basic question:” What is the maximal fraction of
deletions or insertions tolerable by q-ary list-decodable codes with non-vanishing …

We show that any q-ary code with sufficiently good distance can be randomly punctured to
obtain, with high probability, a code that is list decodable up to radius 1---1/q---ε with near …

We speed up existing decoding algorithms for three code classes in different metrics:
interleaved Gabidulin codes in the rank metric, lifted interleaved Gabidulin codes in the …