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

$\boldsymbol{\text{Z}}_{p^s}$-线性广义阿达马码的完全分类

Full classification of $\mathbb{Z}_{p^s}$-linear generalized Hadamard codes

Universitat Politècnica de Catalunya(加泰罗尼亚理工大学)

Dipak K. Bhunia

AI总结:

本文对每个素数$p$完成$\boldsymbol{\text{Z}}_{p^s}$-线性广义阿达马码的分类,利用导出码工具得到不等价码数量公式,完成$\boldsymbol{\text{Z}}_{2^s}$-线性阿达马码分类并证明相关猜想。

摘要:

$\boldsymbol{\text{Z}}_{p^s}$-加性码是$\boldsymbol{\text{Z}}_{p^s}^n$的子群。$\boldsymbol{\text{Z}}_{p^s}$-线性广义阿达马(GH)码是$\boldsymbol{\text{Z}}_p$上的GH码,它是$\boldsymbol{\text{Z}}_{p^s}$-加性码的格雷映射像。递归构造给出这类码$H_p^{t_1,\boldsymbol{\text{...}},t_s}$,其类型为$(n;t_1,\boldsymbol{\text{...}},t_s)$,长度为$p^t$,且已有部分分类结果。本文对每个素数$p$完成这类码的分类。主要工具是导出码,通过删除由其核确定的坐标块外的码元得到。对于$t_1\boldsymbol{\text{≥}}2$的非线性码$H_p^{t_1,\boldsymbol{\text{...}},t_s}$,导出码是同族的$\boldsymbol{\text{Z}}_{p^{s-1}}$-线性GH码,尽管奇素数$p$的机制与二进制不同。因此,当$t\boldsymbol{\text{≥}}3$时,若$p$为奇素数,长度为$p^t$的这类不等价码有$\boldsymbol{\text{P}}(t+1)-\boldsymbol{\text{P}}(t)$个;若$p=2$,则有$\boldsymbol{\text{P}}(t+1)-\boldsymbol{\text{P}}(t)-1$个,其中$\boldsymbol{\text{P}}(n)$是$n$的分拆数。特别地,这完成了$\boldsymbol{\text{Z}}_{2^s}$-线性阿达马码的分类,还证明了关于$t_1\boldsymbol{\text{≥}}2$且$t_s=0$的码的一个猜想。

英文摘要:

The $\mathbb{Z}_{p^s}$-additive codes are subgroups of $\mathbb{Z}_{p^s}^n$. A $\mathbb{Z}_{p^s}$-linear generalized Hadamard (GH) code is a GH code over $\mathbb{Z}_p$ which is the Gray map image of a $\mathbb{Z}_{p^s}$-additive code. A recursive construction gives such codes $H_p^{t_1,\dots,t_s}$, of type $(n;t_1,\dots,t_s)$ and length $p^t$, and a partial classification of them is known. In this paper, we complete the classification of these codes for every prime $p$. The main tool is the derived code, obtained by puncturing the code outside a block of coordinates determined by its kernel. For a nonlinear code $H_p^{t_1,\dots,t_s}$ with $t_1\geq2$, the derived code is a $\mathbb{Z}_{p^{s-1}}$-linear GH code of the same family, although the mechanism for odd $p$ differs from the binary one. As a consequence, for $t\geq3$, there are $\mathcal P(t+1)-\mathcal P(t)$ nonequivalent such codes of length $p^t$ if $p$ is odd, and $\mathcal P(t+1)-\mathcal P(t)-1$ if $p=2$, where $\mathcal P(n)$ is the number of partitions of $n$. In particular, this completes the classification of the $\mathbb{Z}_{2^s}$-linear Hadamard codes. We also prove a conjecture on the codes with $t_1\geq2$ and $t_s=0$.

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

↑