题 目: Explicit construction of optimal locally recoverable codes of distance 5 and 6
主讲人：金玲飞，复旦大学计算机科学技术学院副教授
时 间：2020年5月8日 14:00
地 点：ZOOM云会议ID：2936654514
摘 要: A locally recoverable code is a code over a finite alphabet such that the value of any single coordinate of a codeword can be recovered from the values of a small subset of other coordinates. Such codes have recently attracted great attention as efficient solutions for distributed storage systems. It was shown by Guruswami et al. that the length n of a q-ary linear locally recoverable code with distance d > 5 is upper bounded by O(dq^3). Thus, it is a challenging problem to construct q-ary locally recoverable codes with distance d > 5 and length approaching the upper bound. In this talk, we present an explicit construction of q-ary locally recoverable codes of distance d = 5 and 6.
主讲人简介：金玲飞，复旦大学计算机科学技术学院副教授。2013年在新加坡南洋理工大学获得博士学位，之后分别在荷兰的信息科学研究中心和新加坡的南洋理工大学从事博士后研究。主要研究方向为编码密码，包括经典纠错码，量子纠错码，基于编码的密码等。曾获得国家自然科学基金面上基金等多项国家级和省部级项目资助。
