Topic:
Optimal Pliable Fractional Repetition Codes That Are Locally Recoverable: A Bipartite Graph Approach


Speaker:
Prof. 蘇益生 Yi-Sheng Su
長榮大學資訊工程學系
Dept. of Computer Science and Information Engineering, CJCU

Language :
Chinese


Date:
2018/10/26

Time:
14:20~16:20

Location: Delta building R216, NTHU

Abstract:
Fractional repetition (FR) codes are integral in constructing a class of distributed storage codes with exact repair by transfer. Meanwhile, pliable FR codes are a new type of FR codes in which both the per-node storage and repetition degree can easily be adjusted simultaneously; thus, pliable FR codes are vital for distributed storage systems in which parameters can dynamically change over time. This talk will review and present new results on FR and pliable FR codes, including repair locality, a general bipartite-graph-based approach to constructing optimal pliable FR codes and an explicit construction of optimal pliable FR codes.


Biography:
Yi-Sheng Su received the B.S. and M.S. degrees from the National Tsing Hua University, Hsinchu, Taiwan, ROC, and the Ph.D. degree from the National Cheng Kung University, Tainan, Taiwan, ROC, respectively, all in electrical engineering. From 2011 to 2012, he was a Visiting Scholar with Carnegie Mellon University, Pittsburgh, PA, USA. His research interests include communicati-on networks, communications, coding theory, information theory,and machine learning.