English

The graphs of non-degenerate linear codes

Combinatorics 2022-09-30 v3

Abstract

We consider the Grassmann graph of kk-dimensional subspaces of an nn-dimensional vector space over the qq-element field and its subgraph Γ(n,k)q\Gamma(n,k)_q formed by non-degenerate linear [n,k]q[n,k]_q codes. We assume that 1<k<n11<k<n-1. 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 n=2kn=2k. Our results are the following: if q3q\ge 3 or k2k\ne 2, then every isomorphism of Γ(n,k)q\Gamma(n,k)_{q} to a subgraph of the Grassmann graph can be uniquely extended to an automorphism of the Grassmann graph; in the case when q=k=2q=k=2, there are subgraphs of the Grassmann graph isomorphic to Γ(n,k)q\Gamma(n,k)_{q} and such that isomorphisms between these subgraphs and Γ(n,k)q\Gamma(n,k)_{q} cannot be extended to automorphisms of the Grassmann graph.

Keywords

Cite

@article{arxiv.2203.06625,
  title  = {The graphs of non-degenerate linear codes},
  author = {Mark Pankov},
  journal= {arXiv preprint arXiv:2203.06625},
  year   = {2022}
}
R2 v1 2026-06-24T10:11:24.781Z