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

构造等维码时不同度量的相互作用

The interplay of different metrics for the construction of constant dimension codes

Sascha Kurz

摘要:

恒定维数码的基本问题是确定$\mathbb{F}_q^n$中的一组$k$维子空间(称为码字)的最大可能大小$A_q(n,d;k)$,使得对于所有不同码字对$U$、$W$,子空间距离满足$d_S(U,W):=2k-2\dim(U\cap W)\ge d$.恒定尺寸代码在例如\随机线性网络编码、密码学和分布式存储。$A_q(n,d;k)$的界是最近许多研究论文的主题。提供了一个总体框架,我们调查了许多最新的建设,并显示了进一步改进的潜力。作为例子,我们给出了$A_q(10,4;5)$、$A_q(11,4;4)$、$A_q(12,6;6)$和$A_q(15,4;4)$情形的改进构造。我们也得到一般的上界的子码在这些建设。

英文摘要:

A basic problem for constant dimension codes is to determine the maximum possible size $A_q(n,d;k)$ of a set of $k$-dimensional subspaces in $\mathbb{F}_q^n$, called codewords, such that the subspace distance satisfies $d_S(U,W):=2k-2\dim(U\cap W)\ge d$ for all pairs of different codewords $U$, $W$. Constant dimension codes have applications in e.g.\ random linear network coding, cryptography, and distributed storage. Bounds for $A_q(n,d;k)$ are the topic of many recent research papers. Providing a general framework we survey many of the latest constructions and show up the potential for further improvements. As examples we give improved constructions for the cases $A_q(10,4;5)$, $A_q(11,4;4)$, $A_q(12,6;6)$, and $A_q(15,4;4)$. We also derive general upper bounds for subcodes arising in those constructions.

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

↑