On Decoding Rank-Metric Codes Over Large Fields
Ron M. Roth · IEEE Transactions on Information Theory · 2017
A decoding algorithm is presented for a rank-metric array codes that are based on diagonal interleaving of maximum-distance separable codes. With respect to this metric, such array codes are known to be optimal when the underlying field is algebraically closed. It is also shown that for any list decoding radius that is smaller than the minimum rank distance, the list size can be bounded from above by an expression that is independent of the field.