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.
Recommendations
Cites work
- A complete characterization of irreducible cyclic orbit codes and their Plücker embedding
- Coding for Errors and Erasures in Random Network Coding
- Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
- Cyclic Orbit Codes
- Cyclic orbit codes and stabilizer subfields
- Cyclic subspace codes via subspace polynomials
- Decoding of random network codes
- Error-Correcting Codes in Projective Space
- Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
- Network information flow
- Subspace Polynomials and Cyclic Subspace Codes
- Subspace Polynomials and Limits to List Decoding of Reed–Solomon Codes
Cited in
(32)- Constructions of cyclic constant dimension codes
- Polycyclic codes as invariant subspaces
- Further constructions of cyclic subspace codes
- New constant dimension subspace codes from parallel linkage construction and multilevel construction
- Constructions of Sidon spaces and cyclic subspace codes
- Cyclic orbit flag codes
- Several kinds of large cyclic subspace codes via Sidon spaces
- Cyclic subspace codes via subspace polynomials
- Distance distributions of cyclic orbit codes
- New constructions of large cyclic subspace codes and Sidon spaces
- Constructions of large cyclic constant dimension codes via Sidon spaces
- Further constructions of large cyclic subspace codes via Sidon spaces
- Linear permutations and their compositional inverses over 𝔽qn
- Automorphism groups and isometries for cyclic orbit codes
- New constructions of Sidon spaces and large cyclic constant dimension codes
- On the Minimum Distance of Subspace Codes Generated by Linear Cellular Automata
- Large optimal cyclic subspace codes
- New constructions of large cyclic subspace codes via Sidon spaces
- Two new constructions of cyclic subspace codes via Sidon spaces
- Multi-orbit cyclic subspace codes via direct sum of Sidon spaces
- Construction of large cyclic subspace codes with dimension k+1 via Sidon spaces
- New constructions of cyclic subspace codes via variants of Sidon spaces
- Constructions of optimal cyclic subspace codes via Sidon spaces
- Large cyclic subspace codes over finite fields
- New constructions of cyclic constant-dimension subspace codes based on Sidon spaces and subspace polynomials
- Distance distribution of cyclic orbit flag codes
- Several new kinds of (k+1)-dimensional Sidon spaces and cyclic subspace codes
- Large cyclic subspace codes based on the generalized Sidon spaces
- Three families of large cyclic subspace codes
- New construction of cyclic subspace codes via Sidon spaces
- On the distance distributions of single-orbit cyclic subspace codes
- Two kinds of optimal multi-orbit cyclic subspace codes via Sidon spaces
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)