报告摘要：

This talk focuses on the bounds and constructions of binary linear LRCs. Particularly, two new upper bounds on the dimension of binary linear LRCs are presented. The first one is an explicit bound for binary linear LRCs with disjoint repair groups, which can be regarded as an extension of known explicit bounds for such LRCs to more general code parameters. The second one is based on an optimization problem, and can be applied to any binary linear LRC. Then we give a new construction of binary linear LRCs, and prove their optimality with respect to the simplified bound.

个人介绍：

王安宇博士， 2008年6月获得南开大学应用数学学士学位，2015年6月获得中科院数学与系统科学研究院博士学位，2015年7月至今为中科院信息工程研究所助理研究员，2016年获得中国科协“青年人才托举工程”项目资助。主要研究方向编码理论，在IEEE Trans. Inf. Theory 等国际重要学术期刊以及IEEE ISIT 等国际学术会议上发表多篇高水平论文。