RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 2015 Volume 51, Issue 2, Pages 57–66 (Mi ppi2170)

This article is cited in 1 paper

Coding Theory

On separability of the classes of homogeneous and transitive perfect binary codes

I. Yu. Mogilnykhab, F. I. Solov'evaab

a Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia
b Novosibirsk State University, Novosibirsk, Russia

Abstract: By the example of perfect binary codes, we prove the existence of binary homogeneous nontransitive codes. Thereby, taking into account previously obtained results, we establish a hierarchical picture of extents of linearity for binary codes; namely, there is a strict inclusion of the class of binary linear codes in the class of binary propelinear codes, which are strictly included in the class of binary transitive codes, which, in turn, are strictly included in the class of binary homogeneous codes. We derive a transitivity criterion for perfect binary codes of rank greater by one than the rank of the Hamming code of the same length.

UDC: 621.391.15

Received: 09.12.2014
Revised: 19.02.2015


 English version:
Problems of Information Transmission, 2015, 51:2, 139–147

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025