Cardinal rank metric codes over Galois rings (Q2667084)

This work proposes another look at linear codes under rank metric as well as looking at codes as submodules over finite rings. The rank weight of an element in the rank metric is defined as \(w_R(x) = \operatorname{rank}x = \dim_{\mathbb{F}_q}\langle x_1,\ldots, x_n\rangle.\) A rank metric distance over residual integer rings and the Galois ring analogs to the Gabidulin codes are defined. The metric is directly connected to the cardinal of the codes so it can be called cardinal rank metric. The authors show a singleton-like bound for cardinal rank metric codes over Galois rings, a definition of maximum cardinal rank distance (MCRD) codes as well as a construction of Gabidulin codes over rings that generalize the distance properties of their classic counterparts. It is proved that these Gabidulin codes are in fact MCRD. A decoding algorithm for these Gabidulin codes over rings similar to the algorithm for usual Gabidulin codes is shown.