Several kinds of large cyclic subspace codes via Sidon spaces
From MaRDI portal
Publication:2305902
Subspace codes have attracted much attention in recent years due to their applications to error correction in random network coding. In the paper under review, the authors construct several kinds of large cyclic subspace codes via Sidon spaces and large subspace codes via unions of some Sidon spaces, which extend some known results.
Recommendations
- Further constructions of large cyclic subspace codes via Sidon spaces
- Constructions of Sidon spaces and cyclic subspace codes
- Constructions of Sidon spaces and cyclic subspace codes
- Construction of Sidon spaces with applications to coding
- Cyclic constant dimension subspace codes via the sum of Sidon spaces
Cites work
- A characterization of cyclic subspace codes via subspace polynomials
- A complete characterization of irreducible cyclic orbit codes and their Plücker embedding
- An analogue of Vosper's theorem for extension fields
- Applied finite group actions.
- Coding for Errors and Erasures in Random Network Coding
- Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
- Construction of Sidon spaces with applications to coding
- Constructions of cyclic constant dimension codes
- 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
- scientific article; zbMATH DE number 894528 (Why is no real title available?)
- Network information flow
- Subspace Polynomials and Cyclic Subspace Codes
Cited in
(33)- Further constructions of cyclic subspace codes
- Multivariate public key cryptosystem from Sidon spaces
- New constant dimension subspace codes from parallel linkage construction and multilevel construction
- Constructions of Sidon spaces and cyclic subspace codes
- Cyclic subspace codes via subspace polynomials
- A characterization of cyclic subspace codes via subspace polynomials
- 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
- Multi-orbit cyclic subspace codes and linear sets
- Cyclic constant dimension subspace codes via the sum of Sidon spaces
- Construction of Sidon spaces with applications to coding
- Construction of constant dimension codes via improved inserting construction
- New constructions of Sidon spaces and large cyclic constant dimension codes
- New constructions of constant dimension subspace codes with large sizes
- 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
- On generalized Sidon spaces
- Construction of large cyclic subspace codes via Sidon spaces with dimensions k and k + 1
- 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
- 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
- A new construction of cyclic subspace codes
- New construction of cyclic subspace codes via Sidon spaces
- Two kinds of optimal multi-orbit cyclic subspace codes via Sidon spaces
- Necessary conditions for the existence of subspace 3-designs with nontrivial automorphism groups
This page was built for publication: Several kinds of large cyclic subspace codes via Sidon spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2305902)