Author(s) Vladimir Leontiev^*, Garib Movsisyan, Arthur Osipyan

Affiliation(s)
Moscow State University, Moscow, Russia.
BIT Group, Moscow, Russia.

ABSTRACT
The problem of classification of the subset of the vertices of the n-dimensional unit cube in respect to all “shifts” by a vector from Bⁿ is studied. Some applications for the investigation of the additive channels of communication are represented.

KEYWORDS
Additive Channel, Code, Group, Stabilizer, Cardinality, Transitive Set

Cite this paper
Leontiev, V. , Movsisyan, G. and Osipyan, A. (2014) Classification of the Subsets Bⁿ, and the Additive Channels. Open Journal of Discrete Mathematics, 4, 67-76. doi: 10.4236/ojdm.2014.43010.

References
[1]   Lang, S. (1968) Algebra (in Russian). Moscow, Mir.

[2]   Sachkow, W.N. (1977) Combinatric Methods of Descret Mathematics (in Russian). Nauka, Moscow.

[3]   Leontiev, V.K., Movsisyan, G.L. and Margaryan, J.G. (2006) Perfect Codes in Additive Channels. Reports of RAS, 411, 306-309 (in Russian).

[4]   Leontiev, V.K., Movsisyan, G.L. and Margaryan, J.G. (2008) On Perfect Codes in Additive Channels. Problems of Information Transmission, 44, 12-19.

[5]   Leontiev, V.K., Movsisyan, G.L. and Margaryan, J.G. (2010) Correction of Errors in an Additive Channel. Vol. 2, Westnik RAU, 12-25 (in Armenian).