618 citations · 1.2k across the 56 of their papers we have counts for
6 papers · 2 filters
Singleton-type bounds for list-decoding and list-recovery, and related results
Eitan Goldberg, Chong Shangguan, Itzhak Tamo
List-decoding and list-recovery are important generalizations of unique decoding that received considerable attention over the years. However, the optimal trade-off among list-deco…
A construction of maximally recoverable codes
Alexander Barg, Zitan Chen, Itzhak Tamo
We construct a family of linear maximally recoverable codes with locality and dimension For codes of length with the code alphabet is of t…
Reed Solomon Codes Against Adversarial Insertions and Deletions
Roni Con, Amir Shpilka, Itzhak Tamo
In this work, we study the performance of Reed--Solomon codes against adversarial insertion-deletion (insdel) errors. We prove that over fields of size there are …
List-decoding and list-recovery of Reed-Solomon codes beyond the Johnson radius for any rate
Eitan Goldberg, Chong Shangguan, Itzhak Tamo
Understanding the limits of list-decoding and list-recovery of Reed-Solomon (RS) codes is of prime interest in coding theory and has attracted a lot of attention in recent decades.…
Bounds on the Capacity of PIR over Graphs
Bar Sadeh, Yujie Gu, Itzhak Tamo
In the private information retrieval (PIR) problem, a user wants to retrieve a file from a database without revealing any information about the desired file's identity to the serve…
Nonlinear Repair of Reed-Solomon Codes
Roni Con, Itzhak Tamo
The problem of repairing linear codes and, in particular, Reed Solomon (RS) codes has attracted a lot of attention in recent years due to their extreme importance to distributed st…