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

$[q+1, 2, q]$ MDS码的子域码

The Subfield Codes of $[q+1, 2, q]$ MDS Codes

Ziling Heng, Cunsheng Ding

摘要:

最近,人们研究了具有维数$3$和$4$的大有限域$\gf(q)$上几何码的子域码,得到了$\gf(p)$上距离最优子域码,其中$q=p^m$ .在小域上获得非常好的子域码的关键思想是在小维的扩张域上选择非常好的线性码。本文首先给出了$\gf(q)$上的$[q+1, 2, q]$ MDS码的一般构造,然后研究了$\gf(q)$上的几种$[q+1, 2,q]$ MDS码的$\gf(p)$上的子域码.得到了$\gf(p)$上的两类维数最优码,并得到了$\gf(p)$上的几类近优码.本文还提出了几个有待解决的问题。

英文摘要:

Recently, subfield codes of geometric codes over large finite fields $\gf(q)$ with dimension $3$ and $4$ were studied and distance-optimal subfield codes over $\gf(p)$ were obtained, where $q=p^m$. The key idea for obtaining very good subfield codes over small fields is to choose very good linear codes over an extension field with small dimension. This paper first presents a general construction of $[q+1, 2, q]$ MDS codes over $\gf(q)$, and then studies the subfield codes over $\gf(p)$ of some of the $[q+1, 2,q]$ MDS codes over $\gf(q)$. Two families of dimension-optimal codes over $\gf(p)$ are obtained, and several families of nearly optimal codes over $\gf(p)$ are produced. Several open problems are also proposed in this paper.

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

↑