Chow's theorem for linear codes

Abstract: Let

G a m m a_{k} (V)

be the Grassmann graph formed by

k

-dimensional subspaces of an

n

-dimensional vector space over the finite field

{m a t h b b F}_{q}

consisting of

q

elements and

1 < k < n - 1

. Denote by

G a m m a (n, k)_{q}

the restriction of the Grassmann graph to the set of all non-degenerate linear

[n, k]_{q}

codes. We describe maximal cliques of the graph

G a m m a (n, k)_{q}

and show that every automorphism of this graph is induced by a monomial semilinear automorphism of

V

.

Recommendations

Cites work

Cited in

(10)

This page was built for publication: Chow's theorem for linear codes