  The induced subgraph of the corresponding Grassmann graph formed by simplex
codes is considered. We show that this graph, as the Grassmann graph, contains
two types of maximal cliques. For any two cliques of the first type there is a
monomial linear automorphism transferring one of them to the other. Cliques of
the second type are more complicated and can contain different numbers of
elements.
