A construction of Abelian non-cyclic orbit codes

Cryptography and Communications(2019)

引用 4|浏览8
暂无评分
摘要
A constant dimension code consists of a set of k-dimensional subspaces of \(\mathbb {F}_{q}^{n}\), where \(\mathbb {F}_{q}\) is a finite field of q elements. Orbit codes are constant dimension codes which are defined as orbits under the action of a subgroup of the general linear group on the set of all k-dimensional subspaces of \(\mathbb {F}_{q}^{n}\). If the acting group is Abelian, we call the corresponding orbit code Abelian orbit code. In this paper we present a construction of an Abelian non-cyclic orbit code for which we compute its cardinality and its minimum subspace distance. Our code is a partial spread and consequently its minimum subspace distance is maximal.
更多
查看译文
关键词
Random linear network coding, Subspace codes, Grassmannian, Group action, General linear group, Abelian group
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要