Journal of Information Security

Volume 7, Issue 4 (July 2016)

ISSN Print: 2153-1234   ISSN Online: 2153-1242

Google-based Impact Factor: 3.79  Citations  

On Addition of Sets in Boolean Space

HTML  XML Download Download as PDF (Size: 645KB)  PP. 232-244  
DOI: 10.4236/jis.2016.74019    1,581 Downloads   2,276 Views  Citations

ABSTRACT

In many problems of combinatory analysis, operations of addition of sets are used (sum, direct sum, direct product etc.). In the present paper, as well as in the preceding one [1], some properties of addition operation of sets (namely, Minkowski addition) in Boolean space Bn are presented. Also, sums and multisums of various “classical figures” as: sphere, layer, interval etc. are considered. The obtained results make possible to describe multisums by such characteristics of summands as: the sphere radius, weight of layer, dimension of interval etc. using the methods presented in [2], as well as possible solutions of the equation X+Y=A, where  , are considered. In spite of simplicity of the statement of the problem, complexity of its solutions is obvious at once, when the connection of solutions with constructions of equidistant codes or existence the Hadamard matrices is apparent. The present paper submits certain results (statements) which are to be the ground for next investigations dealing with Minkowski summation operations of sets in Boolean space.

Share and Cite:

Leontiev, V. , Movsisyan, G. and Margaryan, Z. (2016) On Addition of Sets in Boolean Space. Journal of Information Security, 7, 232-244. doi: 10.4236/jis.2016.74019.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.