15 citations · 38 across the 3 of their papers we have counts for
5 papers
Repairing Reed-Solomon codes: Universally achieving the cut-set bound for any number of erasures
Min Ye, Alexander Barg
The repair bandwidth of a code is the minimum amount of data required to repair one or several failed nodes (erasures). For MDS codes, the repair bandwidth is bounded below by the…
Asymptotically optimal private estimation under mean square loss
Min Ye, Alexander Barg
We consider the minimax estimation problem of a discrete distribution with support size under locally differential privacy constraints. A privatization scheme is applied to eac…
Optimal repair of Reed-Solomon codes: Achieving the cut-set bound
Itzhak Tamo, Min Ye, Alexander Barg
Coding for distributed storage gives rise to a new set of problems in coding theory related to the need of reducing inter-node communication in the system. A large number of recent…
Optimal Schemes for Discrete Distribution Estimation under Locally Differential Privacy
Min Ye, Alexander Barg
We consider the minimax estimation problem of a discrete distribution with support size under privacy constraints. A privatization scheme is applied to each raw sample independ…
Explicit constructions of high-rate MDS array codes with optimal repair bandwidth
Min Ye, Alexander Barg
Maximum distance separable (MDS) codes are optimal error-correcting codes in the sense that they provide the maximum failure-tolerance for a given number of parity nodes. Suppose t…