… subcodes. In a second part we show that subfield subcodes of Maximum rank distance
codes can be represented in some sense by the direct sum of Maximum rank distance codes of …

… Recently, by explicitly constructing certain subspace designs, Guruswami and Wang [10]
first presented a explicit construction for the subcode of Gadibulin codes constructed in [7] with …

… -rank metric codes over finite fields. At the heart of the monograph is the construction of
linearized Reed–Solomon codes, a general construction of maximum sum-rank … subcodes are …

… Our codes are explicit subcodes of the well-known Gabidulin … consider subcodes of Gabidulin
codes ([8]), which are analogues of Reed-Solomon codes for the rank-metric. A Gabidulin …

… linearized polynomials, we consider codes in the rank metric. We first define the rank
metric and give basic properties and bounds on the cardinality of codes in the rank metric (namely, …

… subcodes of Gabidulin codes, which are analogues of ReedSolomon codes for the rank-metric…
find linear list-decodable subcodes of certain Gabidulin codes by adapting the subspace …

… The contributions by Mahdavifar and Vardy and by Guruswami and Xing provide list decoding
algorithms for special classes of Gabidulin codes and subcodes of Gabidulin codes [33]–[…

… subcodes of a code which are supported on a fixed vector space. … rank-metric code associated
to an MRD vector rankmetric code or to an optimal vector anticode is an MRD rank-metric …

… In order to distinguish rank-metric codes, in [11], the authors … a rank-metric code C; precisely,
it is the maximum dimension of a subcode of C equivalent to a generalized Gabidulin code. …

… We will be interested in linear rank-metric codes, where C is a subspace over Fh. … consider
subcodes of Gabidulin codes, which are analogues of ReedSolomon codes for the rank-metric…