Add to ORKGIn this paper, we consider an interpolation-based decoding algorithm for a large family of maximum rank distance codes, known as the additive generalized twisted Gabidulin codes, over the finite field Fqn for any prime power q. This paper extends the work of the conference paper Li and Kadir (2019) presented at the International Workshop on Coding and Cryptography 2019, which decoded these codes over finite fields in characteristic two
Generalized twisted Gabidulin codes are one of the few known families of maximum rank matrix codes o...
Rank-metric codes recently attract a lot of attention due to their possible application to network c...
Two challenges in algebraic coding theory are addressed within this dissertation. The first one is ...
In this paper, we consider an interpolation-based decoding algorithm for a large family of maximum r...
In this work, we modify the decoding algorithm for subspace codes by Kotter and Kschischang to get a...
As coding theory plays an important role in data transmission, decoding algorithms for new families ...
International audienceWe generalise Gabidulin codes to the case of infinite fields, eventually with ...
In this paper, a construction of maximum rank distance (MRD) codes as a generalization of generalize...
Wachter-Zeh (IEEE Trans Inf Theory 59(11):7268–7276, 2013), and later together with Raviv (IEEE Tran...
Let k,n,m in {mathbb Z} ^{+} be integers such that kleq n leq m , let mathrm {G}_{n,k}in {mathbb F} ...
For any admissible value of the parameters (n) and (k) there exist ([n,k])-Maximum Rank distance ({m...
Self-duality of Gabidulin codes was investigated in [10]and the authors provided an if and only if c...
International audienceWe investigate the decoding of the sum of Gabidulin codes. We show that there ...
ISBN:978-1-5090-1806-2International audienceGabidulin codes are Maximum Rank Distance (MRD) codes. T...
In this paper we present an interpolation-based decoding algorithm to decode a family of maximum ran...
Generalized twisted Gabidulin codes are one of the few known families of maximum rank matrix codes o...
Rank-metric codes recently attract a lot of attention due to their possible application to network c...
Two challenges in algebraic coding theory are addressed within this dissertation. The first one is ...
In this paper, we consider an interpolation-based decoding algorithm for a large family of maximum r...
In this work, we modify the decoding algorithm for subspace codes by Kotter and Kschischang to get a...
As coding theory plays an important role in data transmission, decoding algorithms for new families ...
International audienceWe generalise Gabidulin codes to the case of infinite fields, eventually with ...
In this paper, a construction of maximum rank distance (MRD) codes as a generalization of generalize...
Wachter-Zeh (IEEE Trans Inf Theory 59(11):7268–7276, 2013), and later together with Raviv (IEEE Tran...
Let k,n,m in {mathbb Z} ^{+} be integers such that kleq n leq m , let mathrm {G}_{n,k}in {mathbb F} ...
For any admissible value of the parameters (n) and (k) there exist ([n,k])-Maximum Rank distance ({m...
Self-duality of Gabidulin codes was investigated in [10]and the authors provided an if and only if c...
International audienceWe investigate the decoding of the sum of Gabidulin codes. We show that there ...
ISBN:978-1-5090-1806-2International audienceGabidulin codes are Maximum Rank Distance (MRD) codes. T...
In this paper we present an interpolation-based decoding algorithm to decode a family of maximum ran...
Generalized twisted Gabidulin codes are one of the few known families of maximum rank matrix codes o...
Rank-metric codes recently attract a lot of attention due to their possible application to network c...
Two challenges in algebraic coding theory are addressed within this dissertation. The first one is ...