Subspace Gabidulin - Bossert codes

The new subspace mixed dimension codes based on the multicomponent Gabidulin -Bossert codes were constructed. The algorithm uses different orders of unit matrices in lifting constructions of the components. The length of the codeword is equal to the sum of these orders. The cardinality of the code is equal to the sum of the contributes of the components. The first component is the main contributor. The cardinality of the constructed code with the known upper bound is compared. The ratio of the cardinality given by the upper bound to the cardinality of the constructed code is greater if subspace distance is greater.