Papers
Topics
Authors
Recent
Search
2000 character limit reached

The graphs of non-degenerate linear codes

Published 13 Mar 2022 in math.CO | (2203.06625v3)

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)<em>q\Gamma(n,k)<em>q formed by non-degenerate linear [n,k]q[n,k]_q codes. We assume that $1<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 q≥3q\ge 3 or k≠2k\ne 2, then every isomorphism of Γ(n,k)</em>q\Gamma(n,k)</em>{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)<em>q\Gamma(n,k)<em>{q} and such that isomorphisms between these subgraphs and Γ(n,k)</em>q\Gamma(n,k)</em>{q} cannot be extended to automorphisms of the Grassmann graph.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.