Talk: Vitaly Skachek (September 17, 2025 at 2:00 PM, Seminar room N2407)
Talks |
Some Results on Batch Codes and Codes for Private Information Retrieval
Vitaly Skachek
University of Tartu
Abstract:
In this talk, we discuss two families of codes suitable for various uses in the distributed data storage systems (DDSSs): batch codes and codes for private information retrieval (PIR). These two families can be viewed as a natural generalizations of the locally repairable codes, which were extensively studied in the context of coding for fault tolerance in the DDSSs. We present some fundamental bounds on the parameters of these two families of codes, as well as code constructions. We also discuss various generalizations of these concepts, such as functional batch codes and functional codes for PIR, and asynchronous batch codes.
Biography:
Vitaly Skachek received the B.A. (Cum Laude), M.Sc. and Ph.D. degrees in computer science from the Technion---Israel Institute of Technology, in 1994, 1998 and 2007, respectively. Since 2012, Dr. Skachek is employed by the Institute of Computer Science, University of Tartu, where he is an Associate Professor. He held visiting positions with the Mathematics of Communications Department, Bell Laboratories, Murray Hill, with the Claude Shannon Institute, University College Dublin, Dublin, with the School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore, with the Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, Urbana, and with the Department of Electrical and Computer Engineering, McGill University, Montreal. He is an Associate Editor for the IEEE Transactions on Information Theory and a Member of the Editorial Board for the Advances in Mathematics of Communications. He served as a guest editor for the special issue of the Cryptography and Communications -- Discrete Structures, Boolean Functions and Sequences. He also served as a guest editor for the special issue on network coding of the EURASIP Journal on Advances in Signal Processing.