618 citations · 1.2k across the 56 of their papers we have counts for
6 papers · 1 filter
The hat guessing number of graphs
Noga Alon, Omri Ben-Eliezer, Chong Shangguan +1
Consider the following hat guessing game: players are placed on vertices of a graph, each wearing a hat whose color is arbitrarily chosen from a set of possible colors.…
Private Information Retrieval in Graph Based Replication Systems
Netanel Raviv, Itzhak Tamo, Eitan Yaakobi
In a Private Information Retrieval (PIR) protocol, a user can download a file from a database without revealing the identity of the file to each individual server. A PIR protocol i…
Minimum Guesswork with an Unreliable Oracle
Natan Ardimanov, Ofer Shayevitz, Itzhak Tamo
We study a guessing game where Alice holds a discrete random variable , and Bob tries to sequentially guess its value. Before the game begins, Bob can obtain side-information ab…
The repair problem for Reed-Solomon codes: Optimal repair of single and multiple erasures, asymptotically optimal node size
Itzhak Tamo, Min Ye, Alexander Barg
The repair problem in distributed storage addresses recovery of the data encoded using an erasure code, for instance, a Reed-Solomon (RS) code. We consider the problem of repairing…
A Bound on the Shannon Capacity via a Linear Programming Variation
Sihuang Hu, Itzhak Tamo, Ofer Shayevitz
We prove an upper bound on the Shannon capacity of a graph via a linear programming variation. We show that our bound can outperform both the Lovász theta number and the Haemers mi…
Optimal LRC codes for all lenghts n <= q
Oleg Kolosov, Alexander Barg, Itzhak Tamo +1
A family of distance-optimal LRC codes from certain subcodes of -ary Reed-Solomon codes, proposed by I.~Tamo and A.~Barg in 2014, assumes that the code length is a multiple…