research
∙
08/28/2023
Storage codes and recoverable systems on lines and grids
A storage code is an assignment of symbols to the vertices of a connecte...
share
research
∙
08/21/2023
Smoothing of binary codes, uniform distributions, and applications
The action of a noise operator on a code transforms it into a distributi...
research
∙
12/23/2022
Storage codes on coset graphs with asymptotically unit rate
A storage code on a graph G is a set of assignments of symbols to the ve...
research
∙
11/02/2022
Node repair on connected graphs, Part II
We continue our study of regenerating codes in distributed storage syste...
research
∙
10/14/2022
On the size of maximal binary codes with 2, 3, and 4 distances
We address the maximum size of binary codes and binary constant weight c...
research
∙
06/27/2022
Semidefinite programming bounds for few-distance sets in the Hamming and Johnson spaces
We study the maximum cardinality problem of a set of few distances in th...
research
∙
10/05/2021
High-rate storage codes on triangle-free graphs
Consider an assignment of bits to the vertices of a connected graph G(V,...
research
∙
08/19/2021
A construction of maximally recoverable codes
We construct a family of linear maximally recoverable codes with localit...
research
∙
08/02/2021
Node repair on connected graphs
We study the problem of erasure correction (node repair) for regeneratin...
research
∙
05/07/2021
Bounds for the sum of distances of spherical sets of small size
We derive upper and lower bounds on the sum of distances of a spherical ...
research
∙
10/01/2020
Recoverable Systems
Motivated by the established notion of storage codes, we consider sets o...
research
∙
07/19/2020
Bounds for discrepancies in the Hamming space
We derive bounds for the ball L_p-discrepancies in the Hamming space for...
research
∙
05/26/2020
Stolarsky's invariance principle for finite metric spaces
Stolarsky's invariance principle quantifies the deviation of a subset of...
research
∙
04/14/2020
Cyclic and convolutional codes with locality
Locally recoverable (LRC) codes and their variants have been extensively...
research
∙
01/20/2020
Enabling optimal access and error correction for the repair of Reed-Solomon codes
Recently Reed-Solomon (RS) codes were shown to possess a repair scheme t...
research
∙
08/26/2019
Capacity of dynamical storage systems
We introduce a dynamical model of node repair in distributed storage sys...
research
∙
01/14/2019
Explicit constructions of MSR codes for clustered distributed storage: The rack-aware storage model
The paper is devoted to the problem of erasure coding in distributed sto...
research
∙
10/16/2018
Optimal locally private estimation under ℓ_p loss for 1< p< 2
We consider the minimax estimation problem of a discrete distribution wi...
research
∙
07/15/2018
Codes with hierarchical locality from covering maps of curves
Locally recoverable (LRC) codes provide ways of recovering erased coordi...
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
∙
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
∙
01/29/2018
