New constant dimension subspace codes from multilevel linkage construction
Huimin Lao, Hao Chen
Abstract
<p style='text-indent:20px;'>One of the main problems in subspace coding is to determine the maximal possible size of a constant dimension subspace code with given parameters. In this paper, we introduce a family of new codes, named rank-restricted Ferrers diagram rank-metric codes, to give an improved construction of constant dimension subspace codes. Our method constructs many new CDCs with larger sizes than previously best-known codes.
Topics & Concepts
MathematicsDimension (graph theory)Subspace topologyConstant (computer programming)Linkage (software)Pure mathematicsDiscrete mathematicsMathematical analysisAlgebra over a fieldChemistryBiochemistryComputer scienceGeneProgramming languageCooperative Communication and Network CodingError Correcting Code TechniquesAdvanced MIMO Systems Optimization