论文标题
具有订单最佳字段大小的最大可回收代码的构造
A Construction of Maximally Recoverable Codes with Order-Optimal Field Size
论文作者
论文摘要
我们构建基于线性化的Reed-Solomon代码的最大可恢复的代码（对应于部分MDS代码）。与已知结构相比，新代码的场尺寸要求较小。对于某些渐近方案，构造的代码具有最佳的字母大小，渐近地与已知的下限匹配。
We construct maximally recoverable codes (corresponding to partial MDS codes) which are based on linearized Reed-Solomon codes. The new codes have a smaller field size requirement compared with known constructions. For certain asymptotic regimes, the constructed codes have order-optimal alphabet size, asymptotically matching the known lower bound.
