A characterization of cyclic subspace codes via subspace polynomials (Q2422150)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7067775
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A characterization of cyclic subspace codes via subspace polynomials |
scientific article; zbMATH DE number 7067775 |
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
0 references
0.9127798676490784
0 references
0.8955546021461487
0 references
0.8616785407066345
0 references
0.8536208271980286
0 references
0.8505160808563232
0 references
