Reliable recognition of masked cartographic scenes during transmission over the network

General questions compressed representation of a given set of binary matrices of the same size by associative masking. Existence and uniqueness are proved: 1) identification in a random binary matrix of one of the matrices of the set of masked patterns of the same size; 2) mistaken recognition on this set of matrices by mask immersed in a random sequence of the inversion of any number of unmasked bits. Connection of these questions with reliability of protection of cartographical data is established at action of interference misinformation in a corporate network.