618 citations · 1.2k across the 56 of their papers we have counts for
7 papers · 1 filter
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…
Combinatorial alphabet-dependent bounds for insdel codes
Xiangliang Kong, Itzhak Tamo, Hengjia Wei
Error-correcting codes resilient to synchronization errors such as insertions and deletions are known as insdel codes. Due to their important applications in DNA storage and comput…
A point-variety incidence theorem over finite fields, and its applications
Xiangliang Kong, Itzhak Tamo
Incidence problems between geometric objects is a key area of focus in the field of discrete geometry. Among them, the study of incidence problems over finite fields have received…
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…