A nesting operation builds cyclic subspace codes with minimum distance 2k-2 whose size asymptotically matches the Johnson bound when n/k is a power of 3.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Asymptotically optimal cyclic subspace codes
A nesting operation builds cyclic subspace codes with minimum distance 2k-2 whose size asymptotically matches the Johnson bound when n/k is a power of 3.