arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1601.02864math.COcs.ITmath.IT
收藏

子空间代码表

Tables of subspace codes

Daniel Heinlein, Michael Kiermaier, Sascha Kurz, Alfred Wassermann

摘要:

子空间编码的主要问题之一是要求具有最小距离的子空间码的最大可能基数至少为$d$ over $\mathbb{F}_q^n$,其中作为向量空间的码字的维度包含在$K\subseteq\{0,1,\dots,n\}$中。在$K=\{k\}$的特殊情况下,人们谈到常维码。由于这个(仍然)新兴的领域是非常繁荣的一方面,有很多连接到经典对象从伽罗瓦几何,这是一个有点难以保持或获得有关目前的知识状态的概述。为此,我们已经实现了一个在线数据库(至少对我们来说)已知的结果在\url{subspacecodes.uni-bayreuth.de}。这份定期更新的技术报告旨在为用户提供如何在研究项目中使用这一技术工具的指南,并描述迄今为止实施的理论和算法知识。

英文摘要:

One of the main problems of subspace coding asks for the maximum possible cardinality of a subspace code with minimum distance at least $d$ over $\mathbb{F}_q^n$, where the dimensions of the codewords, which are vector spaces, are contained in $K\subseteq\{0,1,\dots,n\}$. In the special case of $K=\{k\}$ one speaks of constant dimension codes. Since this (still) emerging field is very prosperous on the one hand side and there are a lot of connections to classical objects from Galois geometry it is a bit difficult to keep or to obtain an overview about the current state of knowledge. To this end we have implemented an on-line database of the (at least to us) known results at \url{subspacecodes.uni-bayreuth.de}. The aim of this recurrently updated technical report is to provide a user guide how this technical tool can be used in research projects and to describe the so far implemented theoretic and algorithmic knowledge.

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

↑