REVIEW 1 cited by
Automorphism groups of Gabidulin-like codes
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original 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.
Forward citations
Cited by 1 Pith paper
-
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 con...
Discussion (0). Continue with ORCID to comment.