In this paper, a construction of maximum rank distance (MRD) codes as a generalization of generalized Gabidulin codes is given. The family of the resulting codes is not covered properly by additive generalized twisted Gabidulin codes, and does not cover all twisted Gabidulin codes. When the basis field has more than two elements, this family includes also non-affine MRD codes, and such codes exist for all parameters. Therefore, these codes are the first non-additive MRD codes for most of the parameters
By exploring some geometry of Segre varieties and Veronese varieties, new families of non linear max...
After a seminal paper by Shekeey (Adv Math Commun 10(3):475-488, 2016), a connection between maximum...
Viewing the codewords of an $[n,k]$ linear code over a field $F_{q^m}$ as ${m} X {n}$ matrices over ...
For any admissible value of the parameters (n) and (k) there exist ([n,k])-Maximum Rank distance ({m...
We investigate rank metric codes using univariate linearized polynomials and multivariate linearized...
We give an infinite family of maximum rank distance (MRD) codes, which covers properly the largest k...
Left and right idealizers are important invariants of linear rank-distance codes. In the case of max...
Left and right idealizers are important invariants of linear rank-distance codes. In the case of max...
Left and right idealizers are important invariants of linear rank-distance codes. In the case of max...
Left and right idealizers are important invariants of linear rank-distance codes. In the case of max...
Left and right idealizers are important invariants of linear rank-distance codes. In the case of max...
We consider linear rank-metric codes in Fnqm. We show that the properties of being maximum rank dist...
Self-duality of Gabidulin codes was investigated in [10]and the authors provided an if and only if c...
In this paper, we present a method to construct new MDS codes by extending Gabidulin codes. This met...
In this paper, we formulate a generic construction of MRD codes that covers almost all the newly fou...
By exploring some geometry of Segre varieties and Veronese varieties, new families of non linear max...
After a seminal paper by Shekeey (Adv Math Commun 10(3):475-488, 2016), a connection between maximum...
Viewing the codewords of an $[n,k]$ linear code over a field $F_{q^m}$ as ${m} X {n}$ matrices over ...
For any admissible value of the parameters (n) and (k) there exist ([n,k])-Maximum Rank distance ({m...
We investigate rank metric codes using univariate linearized polynomials and multivariate linearized...
We give an infinite family of maximum rank distance (MRD) codes, which covers properly the largest k...
Left and right idealizers are important invariants of linear rank-distance codes. In the case of max...
Left and right idealizers are important invariants of linear rank-distance codes. In the case of max...
Left and right idealizers are important invariants of linear rank-distance codes. In the case of max...
Left and right idealizers are important invariants of linear rank-distance codes. In the case of max...
Left and right idealizers are important invariants of linear rank-distance codes. In the case of max...
We consider linear rank-metric codes in Fnqm. We show that the properties of being maximum rank dist...
Self-duality of Gabidulin codes was investigated in [10]and the authors provided an if and only if c...
In this paper, we present a method to construct new MDS codes by extending Gabidulin codes. This met...
In this paper, we formulate a generic construction of MRD codes that covers almost all the newly fou...
By exploring some geometry of Segre varieties and Veronese varieties, new families of non linear max...
After a seminal paper by Shekeey (Adv Math Commun 10(3):475-488, 2016), a connection between maximum...
Viewing the codewords of an $[n,k]$ linear code over a field $F_{q^m}$ as ${m} X {n}$ matrices over ...