Johnson type bounds for mixed dimension subspace codes
classification
🧮 math.CO
keywords
codesboundsdimensionjohnsonsubspaceappliedboundcardinalities
read the original abstract
Subspace codes, i.e., sets of subspaces of $\mathbb{F}_q^v$, are applied in random linear network coding. Here we give improved upper bounds for their cardinalities based on the Johnson bound for constant dimension codes.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.