The graphs of non-degenerate linear codes
Abstract
We consider the Grassmann graph of k-dimensional subspaces of an n-dimensional vector space over the q-element field and its subgraph (n,k)q formed by non-degenerate linear [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=2k. Our results are the following: if q 3 or k 2, then every isomorphism of (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=2, there are subgraphs of the Grassmann graph isomorphic to (n,k)q and such that isomorphisms between these subgraphs and (n,k)q cannot be extended to automorphisms of the Grassmann graph.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.