Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
