A characterization of cyclic subspace codes via subspace polynomials (Q2422150): Difference between revisions

Subspace codes and particularly cyclic subspace codes have attracted a lot of research due to their applications in error correction for random network coding. In this paper under review, the authors explored the parameters of a class of the cyclic subspace codes by using subspace polynomials, which extended some previously known results.