Webtwisted Gabidulin codes +1, where d is its minimum distance. Nonetheless, in all the examples belonging to above mentioned class, we detect infinite families that cannot be … WebJul 12, 2024 · The additive generalized twisted Gabidulin codes, recently introduced by Otal and¨Ozbudakand¨ and¨Ozbudak, is a large family of maximum rank distance (MRD) codes, which covers almost all the ...

Yue Zhou

WebOct 1, 2024 · Abstract Let C be a set of m by n matrices over F q such that the rank of A − B is at least d for all distinct A , B ∈ C. Suppose that m ⩽ n. If # C = q n ( m − d + 1 ), then … WebOct 1, 2024 · We call them generalized twisted Gabidulin codes. When s = 1, H k, s (η, h) is the twisted Gabidulin code H k (η, h). When η = 0, H k, s (η, h) is exactly the generalized Gabidulin code G k, s. In particular, when k = 1, all elements in H 1, s (η, … ship\\u0027s nomenclature

(PDF) Further Generalisations of Twisted Gabidulin Codes

WebMar 1, 2024 · If q 0 = q and η = 0, then H n, k, s, q 0 ( η, h) is a generalized Gabidulin code [8]. • If q 0 = q, s = 1 and η = 0, then H n, k, s, q 0 ( η, h) is a Gabidulin code [3], [5], [14]. Clearly H n, k, s, q 0 ( η, h) is closed under addition but does not have to … WebGeneralized Twisted Gabidulin Codes Lunardon, Guglielmo ; Trombetti, Rocco ; Zhou, Yue Let $\mathcal {C}$ be a set of $m$ by $n$ matrices over $\mathbb {F}_q$ such that the rank of $A-B$ is at least $d$ for all distinct $A,B\in … WebMay 27, 2015 · In this paper, we investigate the property that a generalized twisted Gabidulin code is equivalent to a self-dual code. We show in Theorem 3.6(1) that the conditions in [10] hold for generalized ... ship\u0027s o5