Automorphism groups and new constructions of maximum additive rank metric codes with restrictions

DOI10.1016/J.DISC.2020.111871zbMATH Open1475.94194arXiv1908.02169OpenAlexW3010134521MaRDI QIDQ2182190FDOQ2182190

Authors: Giovanni Longobardi, Guglielmo Lunardon, Yue Zhou, Rocco Trombetti 

Publication date: 21 May 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: Let $d,ninmathbb{Z}^{+}$ such that $1leqdleqn$. A $d$-code $mathcalCsubsetmathbb{F}_q^{nimesn}$ is a subset of order $n$ square matrices with the property that for all pairs of distinct elements in $mathcalC$, the rank of their difference is greater than or equal to $d$. A $d$-code with as many as possible elements is called a maximum $d$-code. The integer $d$ is also called the minimum distance of the code. When $d<n$, a classical example of such an object is the so-called generalized Gabidulin code. There exist several classes of maximum $d$-codes made up respectively of symmetric, alternating and hermitian matrices. In this article we focus on such examples. Precisely, we determine their automorphism groups and solve the equivalence issue for them. Finally, we exhibit a maximum symmetric $2$-code which is not equivalent to the one with same parameters known so far.

Full work available at URL: https://arxiv.org/abs/1908.02169

Recommendations

• On equivalence of maximum additive symmetric rank-distance codes
• On maximum additive Hermitian rank-metric codes
• Hermitian rank distance codes
• Equivalence, group of automorphism and invariants of a family of rank metric codes arising from linearized polynomials
• Nuclei and automorphism groups of generalized twisted Gabidulin codes

zbMATH Keywords

Hermitian matrixsymmetric matrixGabidulin codeautomorphisms groupalternating matrixrank metric code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Cites Work

• Bilinear forms over a finite field, with applications to coding theory
• Title not available (Why is that?)
• Theory of codes with maximum rank distance
• Alternating bilinear forms over GF(q)
• Symmetric bilinear forms over finite fields of even characteristic
• Galois theory and linear algebra
• Equivalence for Rank-Metric and Matrix Codes and Automorphism Groups of Gabidulin Codes
• A new family of linear maximum rank distance codes
• Algebraic structures of MRD codes
• Symmetric bilinear forms over finite fields with applications to coding theory
• Generalized twisted Gabidulin codes
• A New Family of MRD Codes in <inline-formula> <tex-math notation="LaTeX">$\mathbb{F_q}^{2n\times2n}$ </tex-math> </inline-formula> With Right and Middle Nuclei <inline-formula> <tex-math notation="LaTeX">$\mathbb F_{q^n}$ </tex-math> </inline-formula>
• Hermitian rank distance codes

Cited In (4)

• Equivalence, group of automorphism and invariants of a family of rank metric codes arising from linearized polynomials
• On maximum additive Hermitian rank-metric codes
• Rank-Metric Codes, Semifields, and the Average Critical Problem
• Encoding and decoding of several optimal rank metric codes

This page was built for publication: Automorphism groups and new constructions of maximum additive rank metric codes with restrictions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2182190)