Johnson type bounds for mixed dimension subspace codes
Thomas Honold, Michael Kiermaier, and Sascha Kurz
TL;DR
This paper improves the upper bounds on the size of subspace codes used in network coding by extending Johnson bounds to mixed dimension cases, enhancing understanding of code limitations.
Contribution
It introduces new upper bounds for mixed dimension subspace codes based on Johnson bounds, advancing theoretical limits in coding theory.
Findings
Derived improved upper bounds for mixed dimension subspace codes
Extended Johnson bounds from constant to mixed dimension cases
Provides theoretical insights for network coding applications
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCooperative Communication and Network Coding · Coding theory and cryptography · graph theory and CDMA systems