Large cyclic subspace codes based on the generalized Sidon spaces
From MaRDI portal
Cites work
- A characterization of cyclic subspace codes via subspace polynomials
- Coding for Errors and Erasures in Random Network Coding
- Construction of Sidon spaces with applications to coding
- Constructions of cyclic constant dimension codes
- Cyclic constant dimension subspace codes via the sum of Sidon spaces
- Cyclic subspace codes via subspace polynomials
- Deterministic construction of compressed sensing matrices from constant dimension codes
- Double Multilevel Constructions for Constant Dimension Codes
- Error-correcting codes in attenuated space over finite fields
- Large optimal cyclic subspace codes
- Multi-orbit cyclic subspace codes and linear sets
- Network information flow
- New constructions of constant dimension subspace codes with large sizes
- New constructions of large cyclic subspace codes and Sidon spaces
- New constructions of large cyclic subspace codes via Sidon spaces
- On List-Decodability of Random Rank Metric Codes and Subspace Codes
- Several kinds of large cyclic subspace codes via Sidon spaces
- Subspace Polynomials and Limits to List Decoding of Reed–Solomon Codes
- Two new constructions of cyclic subspace codes via Sidon spaces
Cited in
(3)
This page was built for publication: Large cyclic subspace codes based on the generalized Sidon spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6952868)