English

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

Combinatorics 2023-01-18 v1 Information Theory math.IT

Abstract

Consider the Grassmann graph of kk-dimensional subspaces of an nn-dimensional vector space over the qq-element field, 1<k<n11<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=2kn=2k. Let Γ(n,k)q\Gamma(n,k)_q be the subgraph of the Grassman graph formed by all non-degenerate linear [n,k]q[n,k]_q codes. If q3q\ge 3 or k3k\ge 3, 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. For q=k=2q=k=2 there is an isomorphism of Γ(n,k)q\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.

Keywords

Cite

@article{arxiv.2301.06012,
  title  = {On the graph of non-degenerate linear $[n,2]_2$ codes},
  author = {Mark Pankov},
  journal= {arXiv preprint arXiv:2301.06012},
  year   = {2023}
}