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

组合子空间码

Combining subspace codes

Antonio Cossidente, Sascha Kurz, Giuseppe Marino, Francesco Pavese

摘要:

在常维子空间码的情况下,一个重要的问题是确定其码字是具有最小子空间距离$d$的$\mathbb{F}_q^n$的$k$ -子空间的码的最大可能大小$A_q(n, d; k)$。在这里,为了获得改进的结构,我们研究了几种方法来结合子空间码。这使我们能够对许多参数的常维子空间码的下界提出改进,包括$A_q(10, 4; 5)$,$A_q(12, 4; 4)$,$A_q(12, 6, 6)$和$A_q(16, 4; 4)$。

英文摘要:

In the context of constant--dimension subspace codes, an important problem is to determine the largest possible size $A_q(n, d; k)$ of codes whose codewords are $k$-subspaces of $\mathbb{F}_q^n$ with minimum subspace distance $d$. Here in order to obtain improved constructions, we investigate several approaches to combine subspace codes. This allow us to present improvements on the lower bounds for constant--dimension subspace codes for many parameters, including $A_q(10, 4; 5)$, $A_q(12, 4; 4)$, $A_q(12, 6, 6)$ and $A_q(16, 4; 4)$.

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

↑