Regenerating code problems are a series of open problems in network coding in recent years Besides the previous approach by graph theory and computational research in solving these problems, the combinatorial approach shows its advantage gradually In this talk, I will discuss the use of combinatorial approach in the problem of multilevel diversity coding with secure regeneration (MDC-SR), a generalized practical model of regenerating code Firstly we will show that by combinatorial approach we can identify the minimum-bandwidth-regeneration (MBR) point, a point with important operative meaning, of the achievable normalized storage-capacity repair-bandwidth tradeoff regions for the general MDC-SR problem Secondly, we will focus on a special case of multilevel diversity coding with secure regeneration problem With combinatorial approach we can study how the secrecy constraint affect the achievable normalized storage-capacity repair-bandwidth tradeoff region

Shuo Shao received his B.S. (2011) in Electrical Engineering from Southeast University, Nanjing,China, M.A.Sc. (2013) in Electrical Engineering from McMaster University, Ontario,Canadaand Ph.D. (2017) in Electrical Engineering from Texas A&M University. His primary research interest is the area of information theory and network coding.