arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2307.08680cs.ITmath.IT
收藏

固定局部性图上的最优存储码

Optimal storage codes on graphs with fixed locality

Sabyasachi Basu, Manuj Mukherjee

AI总结:

本文研究修复函数为奇偶校验的二进制图存储码,通过显式图构造与对称二进制矩阵秩下界刻画局部性和速率的最优权衡,并得到 r(n)=ω(1) 时速率趋近 1 的渐近分离结论。

摘要:

图上的存储码是“具有局部性的码”的一个实例,用于分布式存储方案以提供本地可修复性。具体而言,图的节点对应存储服务器,每台服务器的邻域构成其在发生故障时可查询以修复所存储数据的服务器集合。具有 n 个顶点的图上的存储码是一组 F_q 上的 n 长码字,其中第 i 个码字符号存储在服务器 i 中,并且可以根据底层图通过查询服务器 i 的邻居来恢复。在本文中,我们研究修复函数为奇偶校验的二进制存储码,并刻画码的局部性与其速率之间的权衡。具体而言,我们证明了在 n 个顶点、局部性为 r 的图上,码的最大速率介于 1−(1/n)⌈n/(r+1)⌉ 与 1−(1/n)⌈n/(r+1)⌉ 之间。速率下界通过显式构造一族具有局部性 r 的图得到,而上界则通过一类对称二进制矩阵在二进制域上的秩的下界获得。我们关于存储码最大速率的上界与 Tamo 和 Barg 针对更大的具有局部性的码类所导出的上界相匹配。作为结果的一个推论,我们得到如下渐近分离结论:给定序列 r(n),n≥1,存在一列 n 顶点图,其上具有速率为 1−o(1) 的存储码,当且仅当 r(n)=ω(1)。

英文摘要:

Storage codes on graphs are an instance of \emph{codes with locality}, which are used in distributed storage schemes to provide local repairability. Specifically, the nodes of the graph correspond to storage servers, and the neighbourhood of each server constitute the set of servers it can query to repair its stored data in the event of a failure. A storage code on a graph with $n$-vertices is a set of $n$-length codewords over $\field_q$ where the $i$th codeword symbol is stored in server $i$, and it can be recovered by querying the neighbours of server $i$ according to the underlying graph. In this work, we look at binary storage codes whose repair function is the parity check, and characterise the tradeoff between the locality of the code and its rate. Specifically, we show that the maximum rate of a code on $n$ vertices with locality $r$ is bounded between $1-1/n\lceil n/(r+1)\rceil$ and $1-1/n\lceil n/(r+1)\rceil$. The lower bound on the rate is derived by constructing an explicit family of graphs with locality $r$, while the upper bound is obtained via a lower bound on the binary-field rank of a class of symmetric binary matrices. Our upper bound on maximal rate of a storage code matches the upper bound on the larger class of codes with locality derived by Tamo and Barg. As a corollary to our result, we obtain the following asymptotic separation result: given a sequence $r(n), n\geq 1$, there exists a sequence of graphs on $n$-vertices with storage codes of rate $1-o(1)$ if and only if $r(n)=ω(1)$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑