Full weight spectrum one-orbit cyclic subspace codes
From MaRDI portal
Cites work
- A generalization of an addition theorem of Kneser.
- A geometric approach to rank metric codes and a classification of constant weight codes
- A note on full weight spectrum codes
- A pentagonal number sieve
- An analogue of Vosper's theorem for extension fields
- Automorphism groups and isometries for cyclic orbit codes
- Classifications and constructions of minimum size linear sets on the projective line
- Coding for Errors and Erasures in Random Network Coding
- Distance distributions of cyclic orbit codes
- Endliche Gruppen I
- Error-Correcting Codes in Projective Space
- Four fundamental parameters of a code and their combinatorial significance
- How many weights can a linear code have?
- Isometry and automorphisms of constant dimension codes
- Maximum weight spectrum codes
- On linear sets of minimum size
- Revisiting Kneser's theorem for field extensions
- The Critical Pairs of Subsets of a Group of Prime Order
Cited in
(4)
This page was built for publication: Full weight spectrum one-orbit cyclic subspace codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7026950)