Talk: Dr. Han Cai (July 17, 2019 at 1:00 PM, LNT Library N2405)
On July 17, 2019 at 1:00 PM, Dr. Han Cai from Ben-Gurion University will be giving a talk in the LNT Library N2405 about "Optimal locally repairable codes with multiple disjoint repair sets".
Optimal locally repairable codes with multiple disjoint repair sets
Dr. Han Cai
Ben-Gurion University of the Negev
Department of Electrical and Computer Engineering
Locally repairable codes are desirable for distributed storage systems to improve the repair efficiency. In this paper, a new combination of codes with locality and codes with multiple disjoint repair sets (also called availability) is introduced. Accordingly, a Singleton-type bound is derived for the new code, which contains the known Singleton bounds as special cases. Optimal constructions are proposed with respect to the new bound. In addition, constructions can also generate optimal codes with multiple disjoint repair sets with respect to the bound by Wang and Zhang, which to the best of our knowledge, are the first explicit constructions that can achieve the bound by Wang and Zhang. This is a joint work with Ying Miao, Moshe Schwartz, and Xiaohu Tang.
Han Cai received the B.S. and M.S. degrees in mathematics from Hubei University, Wuhan, China, in 2009 and 2013, respectively and received the Ph.D. degree from the department of communication engineering, Southwest Jiaotong University, Chengdu, China, in 2017. He is currently a postdoctoral fellow at the Department of Electrical & Computer Engineering, Ben-Gurion University of the Negev, Israel. His research interests include coding theory and sequence design.