Non-minimum tensor rank Gabidulin codes
نویسندگان
چکیده
The tensor rank of some Gabidulin codes small dimension is investigated. In particular, we determine the any metric code equivalent to an 8-dimensional Fq-linear generalized in Fq4×4. This shows that such a never minimum rank. this way, detect first infinite family which are not
منابع مشابه
Improved Cryptanalysis of Rank Metric Schemes Based on Gabidulin Codes
We prove that any variant of the GPT cryptosystem which uses a right column scrambler over the extension field as advocated by the works of Gabidulin et al. with the goal to resist to Overbeck’s structural attack are actually still vulnerable to that attack. We show that by applying the Frobenius operator appropriately on the public key, it is possible to build a Gabidulin code having the same ...
متن کاملIsometries for rank distance and permutation group of Gabidulin codes
The rank distance was introduced in 1985 by E. Gabidulin [1]. He determined a lower bound for the minimum rank distance of a code. Moreover, he constructed a class of codes which meet this bound: the so-called Gabidulin codes. In this paper, we first characterize the linear isometries for the rank distance. Then we determine the isometry group and the permutation group of Gabidulin codes of ful...
متن کاملLow-Rank Matrix Recovery using Gabidulin Codes in Characteristic Zero
We present a new approach on low-rank matrix recovery (LRMR) based on Gabidulin Codes. Since most applications of LRMR deal with matrices over infinite fields, we use the recently introduced generalization of Gabidulin codes to fields of characterstic zero. We show that LRMR can be reduced to decoding of Gabidulin codes and discuss which field extensions can be used in the code construction.
متن کاملOn the genericity of maximum rank distance and Gabidulin codes
We consider linear rank-metric codes in Fqm . We show that the properties of being MRD (maximum rank distance) and non-Gabidulin are generic over the algebraic closure of the underlying field, which implies that over a large extension field a randomly chosen generator matrix generates an MRD and a non-Gabidulin code with high probability. Moreover, we give upper bounds on the respective probabi...
متن کاملGeneralised Twisted Gabidulin Codes
We present a new family of maximum rank distance (MRD) codes. The new class contains codes that are neither equivalent to a generalised Gabidulin nor to a twisted Gabidulin code, the only two known general constructions of linear MRD codes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2022
ISSN: ['1873-1856', '0024-3795']
DOI: https://doi.org/10.1016/j.laa.2022.06.012