Multicomponent codes with maximum code distance
EM Gabidulin, NI Pilipchuk - Problems of information transmission, 2016 - Springer
EM Gabidulin, NI Pilipchuk
Problems of information transmission, 2016•SpringerWe consider subspace codes, called multicomponent codes with zero prefix (MZP codes),
whose subspace code distance is twice their dimension. We find values of parameters for
which the codes are of the maximum cardinality. We construct combined codes where the
last component of the multicomponent code is the code from [1] found by exhaustive search
for particular parameter values. As a result, we obtain a family of subspace codes with
maximum cardinality for a number of parameters. We show that the family of maximum …
whose subspace code distance is twice their dimension. We find values of parameters for
which the codes are of the maximum cardinality. We construct combined codes where the
last component of the multicomponent code is the code from [1] found by exhaustive search
for particular parameter values. As a result, we obtain a family of subspace codes with
maximum cardinality for a number of parameters. We show that the family of maximum …
Abstract
We consider subspace codes, called multicomponent codes with zero prefix (MZP codes), whose subspace code distance is twice their dimension. We find values of parameters for which the codes are of the maximum cardinality. We construct combined codes where the last component of the multicomponent code is the code from [1] found by exhaustive search for particular parameter values. As a result, we obtain a family of subspace codes with maximum cardinality for a number of parameters. We show that the family of maximum-cardinality codes can be extended by using dual codes.
Springer
Showing the best result for this search. See all results