报告人：Ruizhong Wei (卫瑞中)教授 (Lakehead Univeristy)

报告时间：2023年11月9日，9:30-10:30

报告地点：逸夫楼235

报告摘要:

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.  

邀请人：季利均、马欣荣