Most coding theory experts date the origin of the subject with the 1948 publication of A
Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has …

The rank metric measures the distance between two matrices by the rank of their difference.
Codes designed for the rank metric have attracted considerable attention in recent years …

A constant dimension code consists of a set of k-dimensional subspaces of\BBF q n. Orbit
codes are constant dimension codes which are defined as orbits of a subgroup of the …

One of the main problems of subspace coding asks for the maximum possible cardinality of
a subspace code with minimum distance at least $ d $ over $\mathbb {F} _q^ n $, where the …

This paper provides new constructions and lower bounds for subspace codes, using Ferrers
diagram rank-metric codes from matchings of the complete graph and pending blocks. We …

Cyclic orbit codes are constant dimension subspace codes that arise as the orbit of a cyclic
subgroup of the general linear group acting on subspaces in the given ambient space. With …

A construction is presented that allows to produce subspace codes of long length using
subspace codes of shorter length in combination with a rank metric code. The subspace …

The main problem of constant-dimension subspace coding is to determine the maximal
possible size of a set of-dimensional subspaces in such that the subspace distance satisfies …

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 …

A basic problem for the constant dimension subspace coding is to determine the maximal
possible size A q (n, d, k) of a set of k-dimensional subspaces in F nq such that the subspace …