Partition and the Perfect Codes in the Additive Channel

• 作者: Garib Movsisyan
• 来源期刊: 离散数学期刊(英文)
• 学科: 数学
• 关键词: PARTITION PERFECT CODES ADDITIVE CHANNEL
• 年，卷（期）: 2013,（3）
• 页码范围: 112-122
• 页数: 11页
• 分类号: O1

摘要

Many problems of discrete optimization are connected with partition of the n-dimensional space into certain subsets, and the requirements needed for these subsets can be geometrical—for instance, their sphericity—or they can be connected with?certain metrics—for instance, the requirement that subsets are Dirichlet’s regions with Hamming’s metrics [1]. Often partitions into some subsets are considered, on which a functional is optimized [2]. In the present work, the partitions of the n-dimensional space into subsets with “zero” limitation are considered. Such partitions allow us to construct the set of the group codes, V, and the set of the channels, A, between the arbitrary elements, V and A, having correcting relation between them. Descriptions of some classes of both perfect and imperfect codes in the additive channel are presented, too. A way of constructing of group codes correcting the errors in the additive channels is presented, and this method is a further generalization of Hamming’s method of code construction.