Optimal Repair of Polynomials: Achieving the Cut-Set Bound

Wednesday, September 20, 2017 - 1:30pm

Event Calendar Category


Speaker Name

Itzhak Tamo


Tel Aviv University

Building and Room number



It is a well-known fact that any k evaluation points of a polynomial P(x) of degree less than k suffice to calculate (recover) the evaluation at any other point. Motivated by applications to error correcting codes for storage systems, we consider the following question. Is it possible to recover (P (\alpha) for some \alpha, by observing some partial information of d >= k evaluation points P (\alpha_i)? More precisely, the observed partial information is f_i (P (\alpha_i)) for some function f_i which is not necessarily injective, and the goal is to perform the recovery, while minimizing the total amount of observed partial information.


Itzhak Tamo received a B.A. in Mathematics and a B.Sc. in Electrical Engineering in 2008, and a Ph.D. in Electrical Engineering in 2012, all from Ben-Gurion University, Israel. During 2012–2014 he was a postdoctoral researcher at the Institute for Systems Research, University of Maryland, College Park. Since 2015 he has been a senior lecturer in the Electrical Engineering Department, Tel Aviv University, Israel. He was a co-recipient of the IEEE Communication Society Data Storage Technical Committee 2013 Best Paper Award. Together with Alexander Barg he also received the 2015 IEEE Information Theory Society Paper Award and on their work on Locally Recoverable Codes.