DeepAI AI Chat
Log In Sign Up

On the graph of non-degenerate linear [n,2]_2 codes

by   Mark Pankov, et al.

Consider the Grassmann graph of k-dimensional subspaces of an n-dimensional vector space over the q-element field, 1<k<n-1. Every automorphism of this 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 for n=2k. Let Γ(n,k)_q be the subgraph of the Grassman graph formed by all non-degenerate linear [n,k]_q codes. If q≥ 3 or k≥ 3, 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. For q=k=2 there is an isomorphism of Γ(n,k)_q to a subgraph of the Grassmann graph which does not have this property. In this paper, we show that such exceptional isomorphism is unique up to an automorphism of the Grassmann graph.


page 1

page 2

page 3

page 4


On the Grassmann Graph of Linear Codes

Let Γ(n,k) be the Grassmann graph formed by the k-dimensional subspaces ...

Linear Codes with Prescribed Hull Dimension and Minimum Distance

The hull of a linear code (i.e., a finite field vector space) 𝒞 is defin...

Strategies for linear rewriting systems: link with parallel rewriting and involutive divisions

We study rewriting systems whose underlying set of terms is equipped wit...

The Lattice Structure of Linear Subspace Codes

The projective space P_q(n), i.e. the set of all subspaces of the vector...

Build2Vec: Building Representation in Vector Space

In this paper, we represent a methodology of a graph embeddings algorith...

The enhanced derived-vector-space approach to domain decomposition methods

Standard approaches to domain decomposition methods (DDM) are uncapable ...

An open-source framework for ExpFinder integrating N-gram Vector Space Model and μCO-HITS

Finding experts drives successful collaborations and high-quality produc...