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

一类可逆MDS循环码的扩展码

The extended codes of a family of reversible MDS cyclic codes

Zhonghua Sun, Cunsheng Ding

AI总结:

本文研究一类可逆MDS循环码的扩展码,构造出两类MDS码和若干类NMDS码,并确定了部分扩展码的重量分布,这些NMDS码在有限几何、密码学及分布式云存储中有应用价值。

摘要:

参数为 $[n, k, n-k+1]$ 的线性码称为最大距离可分(简称MDS)码。参数为 $[n, k, n-k]$ 的线性码称为几乎最大距离可分(简称AMDS)码。如果一个线性码及其对偶码都是AMDS码,则称该线性码为近最大距离可分(简称NMDS)码。MDS码在理论和实践中都非常重要。对于每个满足 $1 \leq u \leq \lfloor\frac{q+1}2\rfloor$ 的 $u$,存在一种经典的 $[q+1, 2u-1, q-2u+3]$ MDS码构造方法,该码是可逆循环码。本文的目标是研究这一类MDS码的扩展码。我们得到了两类MDS码和几类NMDS码。这些NMDS码在有限几何、密码学以及分布式和云数据存储系统中具有应用。本文还确定了其中一些扩展码的重量分布。

英文摘要:

A linear code with parameters $[n, k, n-k+1]$ is called a maximum distance separable (MDS for short) code. A linear code with parameters $[n, k, n-k]$ is said to be almost maximum distance separable (AMDS for short). A linear code is said to be near maximum distance separable (NMDS for short) if both the code and its dual are AMDS. MDS codes are very important in both theory and practice. There is a classical construction of a $[q+1, 2u-1, q-2u+3]$ MDS code for each $u$ with $1 \leq u \leq \lfloor\frac{q+1}2\rfloor$, which is a reversible and cyclic code. The objective of this paper is to study the extended codes of this family of MDS codes. Two families of MDS codes and several families of NMDS codes are obtained. The NMDS codes have applications in finite geometry, cryptography and distributed and cloud data storage systems. The weight distributions of some of the extended codes are determined.

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

↑