Papers
Topics
Authors
Recent
Search
2000 character limit reached

A note on rank-metric codes

Published 4 Jul 2020 in math.NT | (2007.01991v1)

Abstract: Let $\mathbb{F}q$ denote the finite field with $q=p\lambda$ elements. Maximum Rank-metric codes (MRD for short) are subsets of $M{m\times n}(\mathbb{F}q)$ whose number of elements attains the Singleton-like bound. The first MRD codes known was found by Delsarte (1978) and Gabidulin (1985). Sheekey (2016) presented a new class of MRD codes over $\mathbb{F}q$ called twisted Gabidulin codes and also proposed a generalization of the twisted Gabidulin codes to the codes $\mathcal{H}{k,s}(L_1,L_2)$. The equivalence and duality of twisted Gabidulin codes was discussed by Lunardoni, Trombetti, and Zhou (2018). A new class of MRD codes in $M_{2n\times 2n}(\mathbb{F}q)$ was found by Trombetti-Zhou (2018). In this work, we characterize the equivalence of the class of codes proposed by Sheekey, generalizing the results known for twisted Gabidulin codes and Trombetti-Zhou codes. In the second part of the paper, we restrict ourselves to the case $L_1(x)=x$, where we present its right nucleus, middle nucleus, Delsarte dual and adjoint codes. In the last section, we present the automorphism group of $\mathcal{H}{k,s}(x,L(x))$ and compute its cardinality. In particular, we obtain the number of elements in the automorphism group of the twisted Gabidulin codes.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.