2000 character limit reached
On quasi-cyclic subspace codes (1608.03215v1)
Published 10 Aug 2016 in cs.IT and math.IT
Abstract: Construction of subspace codes with good parameters is one of the most important problems in random network coding. In this paper we present first a generalization of the concept of cyclic subspaces codes and further we show that the usual methods for constructing cyclic subspace codes over finite fields works for m-quasi cyclic codes, namely the subspaces polynomials and Frobenius mappings.