Indexed metadata
Johnson Type Bounds for Mixed Dimension Subspace Codes
Thomas Honold, Michael Kiermaier, Sascha Kurz
Source abstract
Subspace codes, i.e., sets of subspaces of , 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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.