A characterization of cyclic subspace codes via subspace polynomials (Q2422150): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:00, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A characterization of cyclic subspace codes via subspace polynomials |
scientific article |
Statements
A characterization of cyclic subspace codes via subspace polynomials (English)
0 references
18 June 2019
0 references
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.
0 references
random network coding
0 references
cyclic subspace codes
0 references
subspace polynomials
0 references
linearized polynomials
0 references
