Automorphism groups and equivalence criteria are determined for four families of maximum additive rank-metric codes with symmetry restrictions, and a new maximum symmetric 2-code not equivalent to the prior one is constructed.
Automorphism groups of Gabidulin-like codes
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.
fields
math.CO 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Automorphism groups and new constructions of maximum additive rank metric codes with restrictions
Automorphism groups and equivalence criteria are determined for four families of maximum additive rank-metric codes with symmetry restrictions, and a new maximum symmetric 2-code not equivalent to the prior one is constructed.