On quasi-cyclic subspace codes
Information Theory
2016-08-11 v1 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.
Keywords
Cite
@article{arxiv.1608.03215,
title = {On quasi-cyclic subspace codes},
author = {Ismael Gutierrez Garcia and Ivan Molina Naizir},
journal= {arXiv preprint arXiv:1608.03215},
year = {2016}
}
Comments
arXiv admin note: text overlap with arXiv:1504.04553 by other authors