A characterization of cyclic subspace codes via subspace polynomials

From MaRDI portal
Publication:2422150





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.




Cited in
(32)








This page was built for publication: A characterization of cyclic subspace codes via subspace polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2422150)