Some constructions of cyclic and quasi-cyclic subspaces codes

Abstract

In this paper we construct, using GAP System for Computational Discrete Algebra, some cyclic subspace codes, specially an optimal code over the finite field F_{2^{10}}. Further we present a definition and an example of the $q$-analogous of a $m$-quasi-cyclic subspace code over F_{2^{8}}.

References in corpus (1)

• Subspace Polynomials and Cyclic Subspace Codes

Cited by in corpus (2)

• Tables of subspace codes
• Cliques in projective space and construction of Cyclic Grassmannian Codes