In this paper, we propose so-called multicomponent codes with the prescribed subspace metric distance. This class is a generalization of the Silva-Kötter-Kschischang construction (SKK codes). Component constructions are chosen in such a manner that subspace distance between components would be not less than subspace distance of each component. Iterative decoding algorithm is proposed. A few examples are given.