Speaker:Dr. Jin Lingfei is an associate professor at School of Computer Science of Fudan University. In 2013, she received her Ph.D. from Nanyang Technological University of Singapore, and then did her Postdoc at CWI Netherlands and Nanyang Technological University. Her main research interest is coding theory, including classical error correcting codes, quantum error correcting codes, etc. She has been supported by NSFC general fund and several other national, provincial and ministerial projects.
Date:May 08, 2020
Time:14:00—15:00
Location:ZOOM meeting athttps://zoom.com.cn/j/2936654514
Abstract:
A locally recoverable code is a code over afinite 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.
Edited by:Xu Zeyu
