题目：Constructions of optimal binary locally recoverable codes via a general construction of linear codes

主讲人：曹喜望 教授

时间：2022年4月11日（周一）上午9：00

地点：腾讯会议（会议号833407454）

主办单位：必赢242net

主讲人简介：曹喜望，南京航空航天大学必赢242net教授，博士生导师，北京大学获得博士学位。研究方向是有限域及其应用，在差集、指数和、有限域上的多项式、量子信息处理以及代数编码方面做出了出色的工作，其研究成果发表在相关领域的权威期刊IEEE Transaction on Information Theory、Finite Fields and their Applications、Design Codes and Cryptography、Science China（Mathematics）等，发表学术论文130余篇。曹喜望教授先后多次访问过Sydney大学、南洋理工大学，香港科技大学、台湾中央研究院、北京国际数学中心、南开大学陈省身数学研究所等。2010年入选江苏省“青蓝工程”学术带头人，主持国家自然科学基金面上项目和省部级科研项目多项，2017年获得江苏省科学技术奖。

摘要：Locally recoverable codes play a crucial role in distributed storage systems. Many studies have only focused on the constructions of optimal locally recoverable codes with regard to the Singleton bound. In this talk, we will introduce a new approach to constructing optimal binary locally recoverable codes meeting the alphabet dependent bound. Using a general framework for linear codes associated to a set, we provide a new approach to constructing binary locally recoverable codes with locality 2. We turn the problem of designing optimal binary locally recoverable codes into constructing a suitable set. Several constructions of optimal binary locally recoverable codes are proposed by this new method. Finally, we propose constructions of optimal binary locally recoverable codes with locality 2 and locality parameters (r; \delta) by Griesmer codes. This is a joint work with Gaojun Luo.