Johnson type bounds for mixed dimension subspace codes

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.

16 pages, typos corrected

References in corpus (2)

• Tables of subspace codes
• Partial spreads and vector space partitions

Cited by in corpus (1)

• New and Updated Semidefinite Programming Bounds for Subspace Codes