The Taub Faculty of Computer Science Events and Talks

Codes with locality and/or availability have been extensively studied in recent years, including locally repairable codes (LRC), PIR codes, batch codes, etc. Usually in such a code of dimension s, we focus on the recovering sets only for the s information symbols. We propose a natural generalization of PIR and batch codes, named functional PIR codes and functional batch codes, by analyzing the recovering sets for arbitrary vectors of length s. In this talk we present some bounds and constructions for functional PIR and batch codes. This is a joint work with Tuvi Etzion and Eitan Yaakobi.