Comparative Characteristics of Constant and Mixed Dimension Subspace Codes

In this paper, constant and mixed dimension subspace codes based on multicomponent zero prefix codes are considered. Their cardinalities are estimated under the condition that the dimension of constant dimension code is equal to the minimum rank distance. Subject to this condition, cardinality of co...

Full description

Saved in:
Bibliographic Details
Published in2024 IEEE International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON) pp. 93 - 96
Main Author Pilipchuk, Nina
Format Conference Proceeding
LanguageEnglish
Published IEEE 30.09.2024
Subjects
Codes
dimension
finite field
linear code
matrix
rank
subspace
subspace distance
Upper bound
Online AccessGet full text
ISSN2995-0996
DOI10.1109/SIBIRCON63777.2024.10758504

Cover

More Information
Summary:In this paper, constant and mixed dimension subspace codes based on multicomponent zero prefix codes are considered. Their cardinalities are estimated under the condition that the dimension of constant dimension code is equal to the minimum rank distance. Subject to this condition, cardinality of constant dimension code is equal to the upper bound. The algorithm for constructing mixed dimension codes with optimal parameters is described. It is shown that cardinality of mixed dimension codes is much higher than cardinality of constant dimension code at the same values of code words and the same subspace distance.
ISSN:2995-0996
DOI:10.1109/SIBIRCON63777.2024.10758504