research
∙
05/28/2023
Efficient Algorithms for Constructing Minimum-Weight Codewords in Some Extended Binary BCH Codes
We present O(m^3) algorithms for specifying the support of minimum-weigh...
share
research
∙
05/10/2023
Access-Redundancy Tradeoffs in Quantized Linear Computations
Linear real-valued computations over distributed datasets are common in ...
research
∙
01/16/2022
Explicit and Efficient Constructions of linear Codes Against Adversarial Insertions and Deletions
In this work, we study linear error-correcting codes against adversarial...
research
∙
12/10/2021
Singleton-type bounds for list-decoding and list-recovery, and related results
List-decoding and list-recovery are important generalizations of unique ...
research
∙
08/19/2021
A construction of maximally recoverable codes
We construct a family of linear maximally recoverable codes with localit...
research
∙
07/12/2021
Linear and Reed Solomon Codes Against Adversarial Insertions and Deletions
In this work, we study linear error-correcting codes against adversarial...
research
∙
06/14/2021
Multivariate Public Key Cryptosystem from Sidon Spaces
A Sidon space is a subspace of an extension field over a base field in w...
research
∙
05/31/2021
List-decoding and list-recovery of Reed-Solomon codes beyond the Johnson radius for any rate
Understanding the limits of list-decoding and list-recovery of Reed-Solo...
research
∙
05/17/2021
Bounds on the Capacity of PIR over Graphs
In the private information retrieval (PIR) problem, a user wants to retr...
research
∙
04/04/2021
Nonlinear Repair Schemes of Reed-Solomon Codes
The problem of repairing linear codes and, in particular, Reed Solomon (...
research
∙
12/21/2020
Repairing Reed-Solomon Codes Evaluated on Subspaces
We consider the repair problem for Reed–Solomon (RS) codes, evaluated on...
research
∙
11/09/2020
Improved List-Decodability of Reed–Solomon Codes via Tree Packings
This paper shows that there exist Reed–Solomon (RS) codes, over large fi...
research
∙
04/03/2020
Error Detection and Correction in Communication Networks
Let G be a connected graph on n vertices and C be an (n,k,d) code with d...
research
∙
11/04/2019
Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius
List-decoding of Reed-Solomon (RS) codes beyond the so called Johnson ra...
research
∙
02/15/2019
Universally Sparse Hypergraphs with Applications to Coding Theory
For fixed integers r> 2,e> 2,v> r+1, an r-uniform hypergraph is called G...
research
∙
12/23/2018
The hat guessing number of graphs
Consider the following hat guessing game: n players are placed on n vert...
research
∙
12/04/2018
Private Information Retrieval in Graph Based Replication Systems
In a Private Information Retrieval (PIR) protocol, a user can download a...
research
∙
11/20/2018
Minimum Guesswork with an Unreliable Oracle
We study a guessing game where Alice holds a discrete random variable X,...
research
∙
05/04/2018
The repair problem for Reed-Solomon codes: Optimal repair of single and multiple erasures, asymptotically optimal node size
The repair problem in distributed storage addresses recovery of the data...
research
∙
04/16/2018
A Bound on the Shannon Capacity via a Linear Programming Variation
We prove an upper bound on the Shannon capacity of a graph via a linear ...
research
∙
02/01/2018
Optimal LRC codes for all lenghts n <= q
A family of distance-optimal LRC codes from certain subcodes of q-ary Re...
research
∙
09/24/2017
MDS Code Constructions with Small Sub-packetization and Near-optimal Repair Bandwidth
This paper addresses the problem of constructing MDS codes that enable e...
research
∙
07/12/2017
