On Addition of Sets in Boolean Space

Show more

References

[1] Leontiev, V.K., Movsisyan, G.L. and Margaryan, Zh.G. (2016) Algebra and Geometry of Sets in Boolean Space. Open Journal of Discrete Mathematics (OJDM), 6, 25-40.

[2] Movsisyan, G.L. (2013) Dirichlet Regions and Perfect Codes in Additive Channel. Open Journal of Discrete Mathematics (OJDM), 3, 137-142.

[3] Sachkow, W.N. (1977) Combinatory Methods of Discrete Mathematics. Nauka, Moscow. (In Russian)

[4] Leontiev, V.K., Movsisyan, G.L. and Osipyan, A. (2014) Classification of the Subsets and the Additive Channels. Open Journal of Discrete Mathematics (OJDM), 4, 67-76.

[5] Leontiev, V.K. (2001) Selected Problems of Combinatorial Analysis. Bauman Moscow State Technical University, Moscow. (In Russian)

[6] Leontiev, V.K. (2015) Combinatorics and Information. Moscow Institute of Physics and Technology (MIPT), Moscow. (In Russian)

[7] Lang, S. (1968) Algebra. Moscow, Mir. (In Russian)

[8] Nigmatulin, R.G. (1991) Complexity of Boolean Functions. Nauka, Moscow, p. 240. (In Russian)

[9] Movsisyan, G.L. (1982) Perfect Codes in the Schemes Johnson. Bulletin of MSY, Computing Mathematics and Cybernetics, 1, 64-69. (In Russian)

[10] Leontiev, V.K., Movsisyan, G.L. and Margaryan, Zh.G. (2012) Constant Weight of Perfect and D-Representable Codes. Proceedings of the Yerevan State University, Physical and Mathematical Sciences, 16-19.

[11] McWilliams, F.J. and Sloane, N.J.A. (1977) The Theory of Error-Correcting Codes. Parts I and II, North-Holland Publishing Company.

[12] Delsarte, P. (1973) Four Fundamental Parameters of a Code and Their Combinatorial Significance. Information and Control, 23, 407-438.