The graphs of non-degenerate linear codes
Abstract
We consider the Grassmann graph of -dimensional subspaces of an -dimensional vector space over the -element field and its subgraph formed by non-degenerate linear codes. We assume that . It is well-known that every automorphism of the Grassmann graph is induced by a semilinear automorphism of the corresponding vector space or a semilinear isomorphism to the dual vector space; the second possibility is realized only if . Our results are the following: if or , then every isomorphism of to a subgraph of the Grassmann graph can be uniquely extended to an automorphism of the Grassmann graph; in the case when , there are subgraphs of the Grassmann graph isomorphic to and such that isomorphisms between these subgraphs and cannot be extended to automorphisms of the Grassmann graph.
Cite
@article{arxiv.2203.06625,
title = {The graphs of non-degenerate linear codes},
author = {Mark Pankov},
journal= {arXiv preprint arXiv:2203.06625},
year = {2022}
}