arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1703.08291math.CO
收藏

投射可除二进制码

Projective divisible binary codes

Daniel Heinlein, Thomas Honold, Michael Kiermaier, Sascha Kurz, Alfred Wassermann

摘要:

对于哪些正整数$n,k,r$,存在$\mathbb{F}_q$上的线性$[n,k]$码$C$,其中所有码字权重都可被$q^r$整除,并且使得$C$的生成矩阵的列是投影不同的?研究这个问题的动机来自于部分扩展的理论,或者具有最高可能的最小距离的子空间码,因为在$\operatorname{PG}(v-1,\mathbb{F}_q)$中的$r$ -平坦部分扩展的孔的集合对应于具有$k\leq v$的$q^r$ -可除码。在本文中,我们提供了一个介绍这个问题,并报告新的结果$q=2$。

英文摘要:

For which positive integers $n,k,r$ does there exist a linear $[n,k]$ code $C$ over $\mathbb{F}_q$ with all codeword weights divisible by $q^r$ and such that the columns of a generating matrix of $C$ are projectively distinct? The motivation for studying this problem comes from the theory of partial spreads, or subspace codes with the highest possible minimum distance, since the set of holes of a partial spread of $r$-flats in $\operatorname{PG}(v-1,\mathbb{F}_q)$ corresponds to a $q^r$-divisible code with $k\leq v$. In this paper we provide an introduction to this problem and report on new results for $q=2$.

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

↑