Decoding twocomponent subspace codes

The two component subspace code is constructed. The decoding procedure with preliminary determination components is described. The former decoding algorithm is changed. We propose a new criterion to determine which component is the code word - the first or the second component. Instead of the previously used rank criterion, numerical criteria are recommended. The rank criterion determines the component by the rank of a prefix matrix, while the numerical criterion determines by the number of unit elements on the prefix matrix diagonal. Comparisons of these criteria show that the numerical criterion is more efficient in decreasing the error probability, and can be more easily implemented than the rank one.