A storage code is an assignment of symbols to the vertices of a connecte...
The action of a noise operator on a code transforms it into a distributi...
A storage code on a graph G is a set of assignments of symbols to the
ve...
We continue our study of regenerating codes in distributed storage syste...
We address the maximum size of binary codes and binary constant weight c...
We study the maximum cardinality problem of a set of few distances in th...
Consider an assignment of bits to the vertices of a connected graph G(V,...
We construct a family of linear maximally recoverable codes with localit...
We study the problem of erasure correction (node repair) for regeneratin...
We derive upper and lower bounds on the sum of distances of a spherical ...
Motivated by the established notion of storage codes, we consider sets o...
We derive bounds for the ball L_p-discrepancies in the Hamming space for...
Stolarsky's invariance principle quantifies the deviation of a subset of...
Locally recoverable (LRC) codes and their variants have been extensively...
Recently Reed-Solomon (RS) codes were shown to possess a repair scheme t...
We introduce a dynamical model of node repair in distributed storage sys...
The paper is devoted to the problem of erasure coding in distributed sto...
We consider the minimax estimation problem of a discrete distribution wi...
Locally recoverable (LRC) codes provide ways of recovering erased coordi...
The repair problem in distributed storage addresses recovery of the data...
A family of distance-optimal LRC codes from certain subcodes of q-ary
Re...
Two widely studied models of multiple-node repair in distributed storage...