当前位置: X-MOL 学术Linear Algebra its Appl. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Equivalence, group of automorphism and invariants of a family of rank metric codes arising from linearized polynomials
Linear Algebra and its Applications ( IF 1.0 ) Pub Date : 2021-08-18 , DOI: 10.1016/j.laa.2021.08.011
José Alves Oliveira 1
Affiliation  

Let Fq denote the finite field with q=pλ elements. Maximum Rank metric codes (MRD for short) are subsets of Mm×n(Fq) whose number of elements attains the Singleton-like bound. The first MRD codes known were found by Delsarte (1978) and Gabidulin (1985). Sheekey (2015) presented a new class of MRD codes over Fq called twisted Gabidulin codes and also proposed a generalization of the twisted Gabidulin codes to the codes Hk,s(L1,L2). The equivalence and duality of twisted Gabidulin codes were discussed by Lunardon, Trombetti, and Zhou (2016). A new class of MRD codes in M2n×2n(Fq) 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 L1(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 Hk,s(x,L(x)) and compute its cardinality. In particular, we obtain the number of elements in the automorphism group of some twisted Gabidulin codes.



中文翻译:

由线性化多项式产生的秩度量代码族的等价、自同构群和不变量

Fqq=λ元素。最大秩度量代码(简称 MRD)是×n(Fq)其元素数量达到类似单例的界限。Delsarte (1978) 和 Gabidulin (1985) 发现了第一个已知的 MRD 代码。Sheekey (2015) 提出了一类新的 MRD 代码Fq 称为扭曲 Gabidulin 代码,并提出了将扭曲 Gabidulin 代码推广到这些代码 H,(1,2). Lunardon、Trombetti 和 Zhou (2016) 讨论了扭曲 Gabidulin 代码的等价性和对偶性。一类新的 MRD 代码2n×2n(Fq)由 Trombetti-Zhou (2018) 发现。在这项工作中,我们描述了 Sheekey 提出的代码类的等价性,概括了已知的扭曲 Gabidulin 代码和 Trombetti-Zhou 代码的结果。在论文的第二部分,我们将自己限制在案例中1(X)=X,我们展示了它的右核、中核、Delsarte 对偶和伴随代码。在最后一节中,我们提出了自同构群H,(X,(X))并计算其基数。特别地,我们获得了一些扭曲的 Gabidulin 代码的自同构群中的元素数。

更新日期:2021-08-26
down
wechat
bug