We present O(m^3) algorithms for specifying the support of minimum-weigh...
Linear real-valued computations over distributed datasets are common in ...
In this work, we study linear error-correcting codes against adversarial...
List-decoding and list-recovery are important generalizations of unique
...
We construct a family of linear maximally recoverable codes with localit...
In this work, we study linear error-correcting codes against adversarial...
A Sidon space is a subspace of an extension field over a base field in w...
Understanding the limits of list-decoding and list-recovery of Reed-Solo...
In the private information retrieval (PIR) problem, a user wants to retr...
The problem of repairing linear codes and, in particular, Reed Solomon (...
We consider the repair problem for Reed–Solomon (RS) codes, evaluated on...
This paper shows that there exist Reed–Solomon (RS) codes, over large fi...
Let G be a connected graph on n vertices and C be an (n,k,d) code
with d...
List-decoding of Reed-Solomon (RS) codes beyond the so called Johnson ra...
For fixed integers r> 2,e> 2,v> r+1, an r-uniform hypergraph is
called G...
Consider the following hat guessing game: n players are placed on n
vert...
In a Private Information Retrieval (PIR) protocol, a user can download a...
We study a guessing game where Alice holds a discrete random variable X,...
The repair problem in distributed storage addresses recovery of the data...
We prove an upper bound on the Shannon capacity of a graph via a linear
...
A family of distance-optimal LRC codes from certain subcodes of q-ary
Re...
This paper addresses the problem of constructing MDS codes that enable e...
Gradient Descent, and its variants, are a popular method for solving
emp...