  We define linear and semilinear isometry for general subspace codes, used for
random network coding. Furthermore, some results on isometry classes and
automorphism groups of known constant dimension code constructions are derived.
