报告地点：行健楼学术活动室526
邀请人：曹海涛教授
摘要：Coded caching schemes are used to reduce computer network traffics in peak time. To determine the efficiency of the schemes, Maddah-Ali and Niesen defined the information rate of the schemes and gave a construction of optimal coded caching schemes. However,their construction needs to split the data into a large number of packets which may cause constraints in real applications. Many researchers then constructed new coded caching schemes to reduce the number of packets but that increased the information rate. In this talk, we define a new optimization of coded caching schemes under the limitation of the number of packets which can be used to verify the efficiency of these schemes. When the size of packets are limited, the schemes will not be able to get the optimal information rate, but our definition gives a benchmark to see if the schemes are the optimal under our definition.
We also give some constructions for several infinite classes of optimal coded caching schemes under the new definition. Some interesting open problems will also be discussed.
个人简介：Ruizhong Wei’s research interests include Combinatorial Design Theory, Combinatorics and its applications in computer networks and Coding Theory, and his research is supported by NSERC since 2001, including items understudied 2017-2023, NSERC RGPIN-2016-05610 (this is the 5th awards).He has published more than 130 research papers. In latest years, he finished writing articles as First author or Corresponding author, and many articles were published on the master journal list of ISI including: Discrete Math, IEEE Transactions on Communications, IEEE Transactions on Information Theory, Ars Combinatoria, IEEE Access Journal, Materials and continua (CMC), Design Code and Cryptography, Journal of Mathematical Analysis and Applications etc. He is a Fellow of ICA (Institute of Combinatorics and its Application). He was the chair of the department of computer science in Lakehead University.
