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

使用单纯复形的线性码

Linear codes using simplicial complexes

Vidya Sagar, Ritumoni Sarma

摘要:

某些单纯复形用于构造$\mathbb{F}_{2^n}^m$的子集$D$,而$D$又定义了$\mathbb{F}_{2^n}$上的线性码$C_{D}$,该线性码由用于$v\in \mathbb{F}_{2^n}^m$的$(v\cdot d)_{d\in D}$组成。这里我们处理$n=3$的情况,也就是说,当$C_{D}$是一个八进制代码时。利用生成矩阵建立了$C_{D}$与其二进制子域码$C_{D}^{(2)}$之间的关系。对于给定的长度和尺寸,如果一个码具有最大可能的距离,则称之为距离最优。关于Griesmer界,得到了五个无限族的距离最优码,并建立了某些线性码为极小码的充分条件.

英文摘要:

Certain simplicial complexes are used to construct a subset $D$ of $\mathbb{F}_{2^n}^m$ and $D$, in turn, defines the linear code $C_{D}$ over $\mathbb{F}_{2^n}$ that consists of $(v\cdot d)_{d\in D}$ for $v\in \mathbb{F}_{2^n}^m$. Here we deal with the case $n=3$, that is, when $C_{D}$ is an octanary code. We establish a relation between $C_{D}$ and its binary subfield code $C_{D}^{(2)}$ with the help of a generator matrix. For a given length and dimension, a code is called distance optimal if it has the highest possible distance. With respect to the Griesmer bound, five infinite families of distance optimal codes are obtained, and sufficient conditions for certain linear codes to be minimal are established.

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

↑