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

具有受限译码集的纠删码的最小化字母表长度

Minimizing the alphabet size of erasure codes with restricted decoding sets

Mira Gonen, Ishay Haviv, Michael Langberg, Alex Sprintson

摘要:

通过编码函数$C:F^k \rightarrow F^n$定义字母表上的最大距离可分离码$F$,该编码函数允许即使在擦除其符号中的任何$n-k$之后也从码字$C(m)$检索消息$m \in F^k$。对于给定的参数$n$和$k$,一般(非线性)MDS码的最小可能字母表大小是未知的,并且形成编码理论中的中心开放问题之一。本文开始研究的字母表大小的代码在一个广义的设置,其中的编码方案是需要处理一个预先指定的子集的所有可能的擦除模式,自然表示的$n$ -顶点$k$ -均匀超图。我们与这种代码的最小可能的字母大小的超图的强色数和分析的紧密性所获得的界限的线性和非线性设置。我们进一步考虑的问题,允许一个小概率的解码错误的变化。

英文摘要:

A Maximum Distance Separable code over an alphabet $F$ is defined via an encoding function $C:F^k \rightarrow F^n$ that allows to retrieve a message $m \in F^k$ from the codeword $C(m)$ even after erasing any $n-k$ of its symbols. The minimum possible alphabet size of general (non-linear) MDS codes for given parameters $n$ and $k$ is unknown and forms one of the central open problems in coding theory. The paper initiates the study of the alphabet size of codes in a generalized setting where the coding scheme is required to handle a pre-specified subset of all possible erasure patterns, naturally represented by an $n$-vertex $k$-uniform hypergraph. We relate the minimum possible alphabet size of such codes to the strong chromatic number of the hypergraph and analyze the tightness of the obtained bounds for both the linear and non-linear settings. We further consider variations of the problem which allow a small probability of decoding error.

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

↑