报告专家：叶旻

专家所在单位：清华大学深圳国际研究生院

报告时间：2021年8月11日下午

报告地点：腾讯会议

专家简介：叶旻，2012年在北京大学获得学士学位，于2017年在马里兰大学获得博士学位，2017至2019年在普林斯顿大学从事博士后研究工作，从2019年至今在清华大学深圳国际研究生院担任助理教授。2017年获得IEEE Data Storage Best Paper Award，研究方向包括编码理论，信息论，差分隐私和机器学习。

报告摘要：We consider the problem of multiple-node repair in distributed storage systems under the cooperative model, where the repair bandwidth includes the amount of data exchanged between any two different storage nodes. Recently, explicit constructions of MDS codes with optimal cooperative repair bandwidth for all possible parameters were given by Ye and Barg (IEEE Transactions on Information Theory, 2019). The node size (or sub-packetization) in this construction scales as $\exp(\Theta(n^h))$, where $h$ is the number of failed nodes and $n$ is the code length.

In this talk, we give new explicit constructions of optimal MDS codes for all possible parameters under the cooperative model, and the node size of our new constructions only scales as $\exp(O(n))$ for any number of failed nodes. Furthermore, it is known that any optimal MDS code under the cooperative model (including, in particular, our new code construction) also achieves optimal repair bandwidth under the centralized model, where the amount of data exchanged between failed nodes is not included in the repair bandwidth. We further show that the node size of our new construction is also much smaller than that of the best known MDS code constructions for the centralized model.

邀请人：郑大彬

（审核：郑大彬）