Geometry of Translations on a Boolean Cube
- 4 Downloads
The operation of Minkowski addition of geometric figures has a discrete analog, addition of subsets of a Boolean cube viewed as a vector space over the two-element field. Subsets of the Boolean cube (or multivariable Boolean functions) form a monoid with respect to this operation. This monoid is of interest in classical discrete analysis as well as in a number of problems related to information theory. We consider several complexity aspects of this monoid, namely structural, algorithmic, and algebraic.
Key wordsMinkowski addition Boolean cube monoid generating elements primitive elements sequence of multiples
Unable to display preview. Download preview PDF.
- 1.Leontiev, V., Movsisyan, G., and Margaryan, Zh., On Addition of Sets in Boolean Space, J. Inf. Secur., 2016, vol. 7, no. 4, pp. 232–244.Google Scholar
- 3.Leont’ev, V.K., Movsisyan, G.L., and Osipyan, A.A., Classification of Subsets of B n and Additive Channels, Vestnik Moskov. Univ. Ser. I Mat. Mekh., 2014, no. 5, pp. 23–29 [Moscow Univ. Math. Bull. (Engl. Transl.), 2014, vol. 69, no. 5, pp. 198–204].Google Scholar
- 4.Leontiev, V., Movsisyan, G., Osipyan, A., and Margaryan, Zh., On the Matrix and Additive Communication Channels, J. Inf. Secur., 2014, vol. 5, no. 4, pp. 178–191.Google Scholar
- 6.Kitaev, A.Yu., Shen, A.H., and Vyalyi, M.N., Klassicheskie i kvantovye vychisleniya, Moscow: MCCME, 1999. Translated under the title Classical and Quantum Computation, Providence, R.I.: Amer. Math. Soc., 2002.Google Scholar
- 8.Guruswami, V., Micciancio, D., and Regev, O., The Complexity of the Covering Radius Problem on Lattices and Codes, in Proc. 19th IEEE Annual Conf. on Computational Complexity (CCC’04), Amherst, MA, USA, June 21–24, 2004, Washington, DC, USA: IEEE Comput. Soc., 2004, pp. 161–173.Google Scholar