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

.

Review text

Consider the Grassmann graph \(\Gamma_k(V)\) formed by the \(k\)-dimensional subspaces of an \(n\)-dimensional vector space \(V\) over a field \(\mathbb{F}\). The Chow theorem states that every automorphism of the graph \(\Gamma_k(V)\) is induced by a semilinear automorphism of \(V\), when \(1<k<n-1\). Consider the vector space \(V\) of dimension \(n\) over the finite field \(\mathbb{F}_q\) of order \(q\). A \textit{non-degenerate linear \([n,k]_q\)-code} is a \(k\)-dimensional subspace \(C\) of \(V\), such that no position in the \(n\)-tuples of \(C\) always is zero. The authors define the graph \(\Gamma(n,k)_q\) as the subgraph of the Grassmann graph \(\Gamma_k(V)\), restricted to the non-degenerate linear \([n,k]_q\)-codes, where two non-degenerate linear \([n,k]_q\)-codes \(C_1\) and \(C_2\) are adjacent if \(\dim(C_1\cap C_2)=k-1\). The authors develop Chow's theorem for the graph \(\Gamma(n,k)_q\) and prove that every automorphism of this graph is induced by a semilinear automorphism of \(V\). To obtain this result, the authors present a detailed description of the maximal cliques of the graph \(\Gamma(n,k)_q\).

Recommendations

Cites work

Cited in

(10)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2363324)