Automorphism groups of Gabidulin-like codes
From MaRDI portal
Abstract: Let K be a cyclic Galois extension of degree f over k and T a generator of the Galois group. For any v=(v_1,... , v_m)in K^m such that v is linearly independent over k, and any 0< d < m the Gabidulin-like code C(v, T , d) is a maximum rank distance code in the space of f times m matrices over k of dimension fd. This construction unifies the ones available in the literature. We characterise the K-linear codes that are Gabidulin-like codes and determine their rank-metric automorphism group.
Recommendations
- 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
- Isometries for rank distance and permutation group of gabidulin codes
- Constructions of optimal rank-metric codes from automorphisms of rational function fields
- On the number of inequivalent Gabidulin codes
Cites work
- scientific article; zbMATH DE number 1952949 (Why is no real title available?)
- scientific article; zbMATH DE number 905159 (Why is no real title available?)
- A new family of linear maximum rank distance codes
- Bilinear forms over a finite field, with applications to coding theory
- Coding for Errors and Erasures in Random Network Coding
- Conjugacy of Subgroups of the General Linear Group
- Equivalence for Rank-Metric and Matrix Codes and Automorphism Groups of Gabidulin Codes
- Invertible preservers and algebraic groups
- New criteria for MRD and Gabidulin codes and some rank-metric code constructions
- On self-dual MRD codes
- Rank-metric codes and their duality theory
- Subspaces of matrices with special rank properties
- Theory of codes with maximum rank distance
Cited in
(32)- MRD-codes arising from the trinomial \(x^q + x^{q^3} + c x^{q^5} \in \mathbb{F}_{q^6} [x]\)
- Equivalence, group of automorphism and invariants of a family of rank metric codes arising from linearized polynomials
- On a family of linear MRD codes with parameters \([8\times 8,16,7]_q\)
- Linearized trinomials with maximum kernel
- Rank-metric codes, linear sets, and their duality
- On kernels and nuclei of rank metric codes
- Identifiers for MRD-codes
- Automorphism groups of some AG codes
- Isometries for rank distance and permutation group of gabidulin codes
- Extending two families of maximum rank distance codes
- A new family of maximum scattered linear sets in \(\mathrm{PG}(1,q^6)\)
- Vertex properties of maximum scattered linear sets of \(\mathrm{PG} ( 1 , q^n )\)
- Linear sets and MRD-codes arising from a class of scattered linearized polynomials
- Partially scattered linearized polynomials and rank metric codes
- Automorphisms of hyperelliptic GAG-codes
- Puncturing maximum rank distance codes
- Scattered subspaces and related codes
- A new family of MRD-codes
- Partition-balanced families of codes and asymptotic enumeration in coding theory
- On maximum additive Hermitian rank-metric codes
- New maximum scattered linear sets of the projective line
- On equivalence of maximum additive symmetric rank-distance codes
- New semifields and new MRD codes from skew polynomial rings
- Nuclei and automorphism groups of generalized twisted Gabidulin codes
- MRD codes with maximum idealizers
- Asymptotics of Moore exponent sets
- Linear sets from projection of Desarguesian spreads
- Automorphism groups of Grassmann codes
- Rank-Metric Codes, Semifields, and the Average Critical Problem
- On the number of inequivalent Gabidulin codes
- Classification of large partial plane spreads in \(\mathrm{PG}(6,2)\) and related combinatorial objects
- Codes with few weights arising from linear sets
This page was built for publication: Automorphism groups of Gabidulin-like codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q330078)
