Back to Search
Start Over
A characterization of cyclic subspace codes via subspace polynomials.
- Source :
-
Finite Fields & Their Applications . May2019, Vol. 57, p1-12. 12p. - Publication Year :
- 2019
-
Abstract
- Abstract 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, we explore the parameters of a class of the cyclic subspace codes whose subspace polynomials are more generalized. Therefore, some corollaries that extend the previously known results are obtained. Finally, a construction of k -dimensional cyclic subspace codes of size q N − 1 q − 1 and minimal distance 2 k − 2 is provided. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 10715797
- Volume :
- 57
- Database :
- Academic Search Index
- Journal :
- Finite Fields & Their Applications
- Publication Type :
- Academic Journal
- Accession number :
- 135602267
- Full Text :
- https://doi.org/10.1016/j.ffa.2019.01.002