8 citations · 10 across the 12 of their papers we have counts for
4 papers · 2 filters
Quantum Locally Recoverable Codes via Good Polynomials
Sandeep Sharma, Vinayak Ramkumar, Itzhak Tamo
Locally recoverable codes (LRCs) with locality parameter can recover any erased code symbol by accessing other code symbols. This local recovery property is of great intere…
-MSR Codes for Any Set of Helper Nodes
Vinayak Ramkumar, Netanel Raviv, Itzhak Tamo
Minimum storage regenerating (MSR) codes are a class of maximum distance separable (MDS) array codes capable of repairing any single failed node by downloading the minimum amount o…
Non-Binary Covering Codes for Low-Access Computations
Vinayak Ramkumar, Netanel Raviv, Itzhak Tamo
Given a real dataset and a computation family, we wish to encode and store the dataset in a distributed system so that any computation from the family can be performed by accessing…
Perfect Subset Privacy in Polynomial Computation via Reed-Muller Information Super-sets
Zirui Deng, Vinayak Ramkumar, Netanel Raviv
Delegating large-scale computations to service providers is a common practice which raises privacy concerns. This paper studies information-theoretic privacy-preserving delegation…