

























We construct a family of linear maximally recoverable codes with locality $r$ and dimension $r+1.$ For codes of length $n$ with $r\approx n^α, 0\leα\le 1$ the code alphabet is of the order $n^{1+3α},$ which improves upon the previously known constructions of maximally recoverable codes.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。