Abstract: Maximum rank distance codes are the equivalent in rank-metric of Reed-Solomon codes whose subcodes have been widely studied.

In this paper we characterize subspace subcodes of MRD codes and we show that it is possible to construct efficient polynomial-time encoding-decoding procedures ...

This paper characterize subspace subcodes of MRD codes and shows that it is possible to construct efficient polynomial-time encoding-decoding procedures for ...

Jan 29, 2023 · In this paper, we provide a generalization of Subspace Subcodes in Rank metric introduced by Gabidulin and Loidreau.

Maximum rank distance codes are the equivalent in rank-metric of Reed-Solomon codes whose subcodes have been widely studied. In this paper we characterize ...

\par In this paper, we provide a generalization of Subspace Subcodes in Rank metric introduced by Gabidulin and Loidreau. We also characterize this family by ...

These codes can be seen as the analogs of Reed-Solomon codes (hereafter denoted RS-codes) for rank metric. In this paper their subspace subcodes are ...

Dec 11, 2023 · The focus of this chapter is on some of the fundamental parameters of a rank-metric code: minimum distance, rank distribution, maximum rank, ...

Codes in the rank metric of length n ≤ m can be considered as a set of m×n matrices over a finite field Fq or equivalently as a set of vectors of length n over ...

Specifically, the proposed local rank-metric codes can recover locally from crisscross failures, which affect a limited number of rows and/or columns of the ...