Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 15 Jan 2023 in math.CO, cs.IT, and math.IT | (2301.06012v1)

Abstract: 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 $\Gamma(n,k)q$ be the subgraph of the Grassman graph formed by all non-degenerate linear $[n,k]_q$ codes. If $q\ge 3$ or $k\ge 3$, then every isomorphism of $\Gamma(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 $\Gamma(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.

Citations (2)

Summary

Paper to Video (Beta)

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.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.