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

利用单纯复形构造的某些二元极小码

Certain binary minimal codes constructed using simplicial complexes

Vidya Sagar, Ritumoni Sarma

AI总结:

本文在非链环上利用单纯复形构造二元线性码,研究其 Gray 像和子域类码,给出极小性与自正交性的充分条件,并构造了一族达到 Griesmer 界的最优码。

摘要:

本文在非链环 $\mathcal{R} = \mathbb{F}_2[u]/\langle u^3 - u\rangle $ 上展开研究。设 $m\in \mathbb{N}$,并令 $L, M, N \subseteq [m]:=\{1, 2, \dots, m\}$。对于 $X\subseteq [m]$,定义 $Δ_X:=\{v \in \mathbb{F}_2^m : \textnormal{Supp}(v)\subseteq X\}$,并令 $D:= (1+u^2)D_1 + u^2D_2 + (u+u^2)D_3$,这是一个由 $\mathcal{R}^m$ 中元素构成的有序有限多重集,其中 $D_1\in \{Δ_L, Δ_L^c\}, D_2\in \{Δ_M, Δ_M^c\}, D_3\in \{Δ_N, Δ_N^c\}$。针对每一个 $D$,本文研究了由 $\{\big(v\cdot d\big)_{d\in D} : v \in \mathcal{R}^m \}$ 定义的 $\mathcal{R}$ 上的线性码 $C_D$。此外,本文还在上述工作中考虑了具有两个极大元的单纯复形。我们研究了这些码的二元 Gray 像以及与 $\mathcal{R}$ 的某个 $\mathbb{F}_{2}$-泛函相对应的二元子域类码。在每种情形下,都得到了这些二元线性码为极小码和自正交码的充分条件。此外,我们构造了一族关于 Griesmer 界的最优码。本文得到的大多数码都是少重量码。

英文摘要:

In this manuscript, we work over the non-chain ring $\mathcal{R} = \mathbb{F}_2[u]/\langle u^3 - u\rangle $. Let $m\in \mathbb{N}$ and let $L, M, N \subseteq [m]:=\{1, 2, \dots, m\}$. For $X\subseteq [m]$, define $Δ_X:=\{v \in \mathbb{F}_2^m : \textnormal{Supp}(v)\subseteq X\}$ and $D:= (1+u^2)D_1 + u^2D_2 + (u+u^2)D_3$, an ordered finite multiset consisting of elements from $\mathcal{R}^m$, where $D_1\in \{Δ_L, Δ_L^c\}, D_2\in \{Δ_M, Δ_M^c\}, D_3\in \{Δ_N, Δ_N^c\}$. The linear code $C_D$ over $\mathcal{R}$ defined by $\{\big(v\cdot d\big)_{d\in D} : v \in \mathcal{R}^m \}$ is studied for each $D$. Further, we also consider simplicial complexes with two maximal elements in the above work. We study their binary Gray images and the binary subfield-like codes corresponding to a certain $\mathbb{F}_{2}$-functional of $\mathcal{R}$. Sufficient conditions for these binary linear codes to be minimal and self-orthogonal are obtained in each case. Besides, we produce an infinite family of optimal codes with respect to the Griesmer bound. Most of the codes obtained in this manuscript are few-weight codes.

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

↑