31 research outputs found
Optimal Ferrers Diagram Rank-Metric Codes
Optimal rank-metric codes in Ferrers diagrams are considered. Such codes
consist of matrices having zeros at certain fixed positions and can be used to
construct good codes in the projective space. Four techniques and constructions
of Ferrers diagram rank-metric codes are presented, each providing optimal
codes for different diagrams and parameters.Comment: to be presented in Algebra, Codes, and Networks, Bordeaux, June 16 -
20, 201
Combining subspace codes
In the context of constant--dimension subspace codes, an important problem is
to determine the largest possible size of codes whose codewords
are -subspaces of with minimum subspace distance . Here
in order to obtain improved constructions, we investigate several approaches to
combine subspace codes. This allow us to present improvements on the lower
bounds for constant--dimension subspace codes for many parameters, including
, , and .Comment: 17 pages; construction for A_(10,4;5) was flawe