English

Connectedness of projective codes in the Grassmann graph

Combinatorics 2020-04-17 v3

Abstract

Using the concept of projective systems for linear codes and elementary linear algebra, we show that projective [n,k]q[n,k]_q codes form a connected subgraph in the Grassmann graph consisting of kk-dimensional subspaces of an nn-dimensional vector space over the qq-element field.

Keywords

Cite

@article{arxiv.1806.02729,
  title  = {Connectedness of projective codes in the Grassmann graph},
  author = {Mark Pankov},
  journal= {arXiv preprint arXiv:1806.02729},
  year   = {2020}
}

Comments

There is a very simple proof of the main result which makes it obvious

R2 v1 2026-06-23T02:22:35.635Z