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

无三角形图上BCH族存储码的码率为1

The BCH Family of Storage Codes on Triangle-Free Graphs is of Unit Rate

Haihua Deng, Hexiang Huang, Guobiao Weng, Qing Xiang

AI总结:

本研究解决了Barg与Zémor2022年提出的公开问题,证明无三角形图上BCH族存储码码率为1,并推广其构造得到更多同类码率为1的存储码,推进了高码率存储码构造研究。

摘要:

设$Γ$是一个具有$n$个顶点的简单连通图,$C$是长度为$n$的码,其坐标由$Γ$的顶点索引。若对任意码字$c \u0026#8712; C$,都能通过访问$c$每个坐标在$Γ$中的邻居来恢复该坐标的信息,则称$C$是$Γ$上的存储码。该领域的核心问题是构造无三角形图上的高码率存储码。本文解决了Barg与Zémor在2022年提出的一个公开问题,证明BCH族存储码的码率为1。此外,我们推广了BCH族的构造方法,得到了更多无三角形图上的码率为1的存储码。

英文摘要:

Let $Γ$ be a simple connected graph on $n$ vertices, and let $C$ be a code of length $n$ whose coordinates are indexed by the vertices of $Γ$. We say that $C$ is a \textit{storage code} on $Γ$ if for any codeword $c \in C$, one can recover the information on each coordinate of $c$ by accessing its neighbors in $Γ$. The main problem here is to construct high-rate storage codes on triangle-free graphs. In this paper, we solve an open problem posed by Barg and Zémor in 2022, showing that the BCH family of storage codes is of unit rate. Furthermore, we generalize the construction of the BCH family and obtain more storage codes of unit rate on triangle-free graphs.

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

↑