Abelian non-cyclic orbit codes and multishot subspace codes (Q2210640)

Orbit codes are subspace codes which are used in network coding. If \(V\) is a vector space with generator matrix \({\mathcal V}\) and \(G\) is a subgroup of \(\mathrm{GL}_n(\mathbb F_q)\) then \(\{ \mathrm{RowSpace}(\mathcal{V}A) \mid A \in G \}\) is called an orbit code. The authors of the paper characterize orbit codes as geometrically uniform codes based on the description of all isometries over a projective geometry. Using this characterization, they provide a procedure to reduce the number of computations of the minimum subspace distance using Abelian orbit codes. Then using a subset \(S\) of \(k\) dimensional subspaces of an \(n\) dimensional vector space over \({\mathbb F}_q\), they use the group action of \(G\) over \(S\) to partition it as a collection of orbit codes. This gives a systematic method of partitioning \(S\) and gives a reduction of the number of computations needed to obtain the intrasubset subspace distance in each level of the partition.