题目：On Optimal Locally Repairable Codes with Super-Linear Length
报告摘要：In this talk, on one hand, we are going to talk about locally repairable codes optimal minimum Hamming distance. New upper bounds on the length of such optimal codes are derived. The new bounds both improve and generalize previously known bounds. On the other hand, our focus is optimal codes, whose length is order-optimal with respect to the new upper bounds. Notably, the length of the codes is super-linear in the alphabet size.
会议 ID：982 474 490