A new construction of cyclic subspace codes
From MaRDI portal
Cites work
- An analogue of Vosper's theorem for extension fields
- Coding for Errors and Erasures in Random Network Coding
- Construction of Sidon spaces with applications to coding
- Constructions and equivalence of Sidon spaces
- Constructions of Sidon spaces and cyclic subspace codes
- Constructions of cyclic constant dimension codes
- Constructions of large cyclic constant dimension codes via Sidon spaces
- Cyclic Orbit Codes
- Cyclic constant dimension subspace codes via the sum of Sidon spaces
- Cyclic subspace codes via subspace polynomials
- Error-Correcting Codes in Projective Space
- Existence of q-analogs of Steiner systems
- Further constructions of cyclic subspace codes
- Further constructions of large cyclic subspace codes via Sidon spaces
- Large optimal cyclic subspace codes
- Linearized trinomials with maximum kernel
- Multi-orbit cyclic subspace codes and linear sets
- New constructions of Sidon spaces and large cyclic constant dimension codes
- New constructions of large cyclic subspace codes and Sidon spaces
- Several kinds of large cyclic subspace codes via Sidon spaces
- Subspace Polynomials and Cyclic Subspace Codes
Cited in
(7)- On equidistant single-orbit cyclic and quasi-cyclic subspace codes
- New construction 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
This page was built for publication: A new construction of cyclic subspace codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7026755)