Isometries for rank distance and permutation group of gabidulin codes
نویسندگان
چکیده
منابع مشابه
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...
متن کامل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...
متن کاملPermutation codes invariant under isometries
The symmetric group Sn on n letters is a metric space with respect to the Hamming distance. The corresponding isometry group is well known to be isomorphic to the wreath product Sn oS2. A subset of Sn is called a permutation code or a permutation array, and the largest possible size of a permutation code with minimum Hamming distance d is denoted by M(n, d). Using exhaustive search by computer ...
متن کامل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 ...
متن کامل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.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2003
ISSN: 0018-9448
DOI: 10.1109/tit.2003.819322