arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1707.00650math.COcs.ITmath.IT
收藏

关于可除码的长度

On the lengths of divisible codes

Michael Kiermaier, Sascha Kurz

摘要:

本文确定了环$\mathbb{F}_q$上所有具有非负整数$r$的$q^r$ -可除线性码的有效长度.为此,引入整数$n$的$S_q(r)$-进展开。证明了存在有效长度为$n$的$q^r$ -可分$\mathbb{F}_q$ -线性码当且仅当$n$的$S_q(r)$ -adic展开式的首项系数非负.此外,有效长度$n$的$q^r$ -可除码的最大权重至多为$σq^r$,其中$σ$表示$n$的$S_q(r)$-进展开的交叉和.这个结果在伽罗瓦几何中有应用。最近的一个定理的N{x 0}stase和Sissokho的最大规模的部分蔓延如下作为一个推论。此外,我们还得到了常维子空间码的Johnson界的一个改进。

英文摘要:

In this article, the effective lengths of all $q^r$-divisible linear codes over $\mathbb{F}_q$ with a non-negative integer $r$ are determined. For that purpose, the $S_q(r)$-adic expansion of an integer $n$ is introduced. It is shown that there exists a $q^r$-divisible $\mathbb{F}_q$-linear code of effective length $n$ if and only if the leading coefficient of the $S_q(r)$-adic expansion of $n$ is non-negative. Furthermore, the maximum weight of a $q^r$-divisible code of effective length $n$ is at most $σq^r$, where $σ$ denotes the cross-sum of the $S_q(r)$-adic expansion of $n$. This result has applications in Galois geometries. A recent theorem of N{ă}stase and Sissokho on the maximum size of a partial spread follows as a corollary. Furthermore, we get an improvement of the Johnson bound for constant dimension subspace codes.

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

↑