arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1902.06624cs.ITmath.IT
收藏

最大距离可分码排序

Maximum distance separable codes to order

Ted Hurley, Donny Hurley, Barry Hurley

摘要:

最大距离可分离(MDS)是根据要求的规格构造的。这些码在有限域上被明确地给出,并具有有效的编码和译码算法。对于给定的$R, \, 0 < R < 1$,本文导出了有限域上的一系列距离与长度之比接近$(1-R)$的码.对于给定的速率$R=\frac{r}{n}$,在$p$不整除$n$的情况下,构造特征$p$的有限域上的码序列,使得距离与长度之比接近$(1-R)$ .对于给定的字段$GF(q)$,为任何$r$构造形式为$(q-1,r)$的MDS码。这些码是包含的,易于用复杂度为$\max\{O(n\log n), t^2\}$的有效编码和解码算法构造,其中$t$是码的纠错能力。

英文摘要:

Maximum distance separable (MDS) are constructed to required specifications. The codes are explicitly given over finite fields with efficient encoding and decoding algorithms. Series of such codes over finite fields with ratio of distance to length approaching $(1-R)$ for given $R, \, 0 < R < 1$ are derived. For given rate $R=\frac{r}{n}$, with $p$ not dividing $n$, series of codes over finite fields of characteristic $p$ are constructed such that the ratio of the distance to the length approaches $(1-R)$. For a given field $GF(q)$ MDS codes of the form $(q-1,r)$ are constructed for any $r$. The codes are encompassing, easy to construct with efficient encoding and decoding algorithms of complexity $\max\{O(n\log n), t^2\}$, where $t$ is the error-correcting capability of the code.

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

↑