关于修复代数几何码的一个注记

A Note on Repairing Algebraic Geometry Codes

在分布式存储系统中,某些网络节点会因为各种原因发生损坏,需要利用其余有效节点结合一定的技术手段恢复失效的数据。金玲飞一文中给出了修复代数几何码的修复方案及其带宽计算,本文通过对修复方案中某一函数的参数值进行修正,突破了原方案中仅允许有限域的特征为偶数这一限制,并证明在新的函数下,修复方案的带宽仍然达到最优。

In a distributed storage system, some network nodes may be damaged for various reasons, and the remaining effective nodes need to be combined with certain technical means to recover the failed data. In Jin Lingfei's paper, the repair scheme of repairing algebraic geometry code and the calculation of its bandwidth are given. This paper corrects the parameter values in a function in the repair scheme to breaks through a limitation from Jin’s scheme, which only allows the finite field feature to be even. It is also proved that the bandwidth of the repair scheme is still optimal under the new function.