618 citations · 1.2k across the 56 of their papers we have counts for
5 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…
Repairing Reed-Solomon Codes over Prime Fields via Exponential Sums
Roni Con, Noah Shutty, Itzhak Tamo +1
This paper presents two repair schemes for low-rate Reed-Solomon (RS) codes over prime fields that can repair any node by downloading a constant number of bits from each surviving…
Explicit Subcodes of Reed-Solomon Codes that Efficiently Achieve List Decoding Capacity
Amit Berman, Yaron Shany, Itzhak Tamo
In this paper, we introduce a novel explicit family of subcodes of Reed-Solomon (RS) codes that efficiently achieve list decoding capacity with a constant output list size. Our app…