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

等距子空间码

Equidistant subspace codes

Elisa Gorla, Alberto Ravagnani

摘要:

本文研究了等距子空间码,即具有两个不同码字具有相同距离性质的子空间码。我们提供了一个几乎完整的分类,这样的代码的假设下,基数的地面字段是足够大的。更精确地说,我们证明了,对于大多数的参数值,等距码的最大基数是一个向日葵或正交的向日葵。我们还研究了具有极值参数的等距码,并建立了非向日葵等距码的一般性质。最后,我们提出了一个系统的构造等距码的基础上,我们以前的部分扩频码的建设,并提供了一个有效的译码算法。

英文摘要:

In this paper we study equidistant subspace codes, i.e. subspace codes with the property that each two distinct codewords have the same distance. We provide an almost complete classification of such codes under the assumption that the cardinality of the ground field is large enough. More precisely, we prove that for most values of the parameters, an equidistant code of maximum cardinality is either a sunflower or the orthogonal of a sunflower. We also study equidistant codes with extremal parameters, and establish general properties of equidistant codes that are not sunflowers. Finally, we propose a systematic construction of equidistant codes based on our previous construction of partial spread codes, and provide an efficient decoding algorithm.

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

↑