RUS  ENG
Full version
JOURNALS // Diskretnyi Analiz i Issledovanie Operatsii // Archive

Diskretn. Anal. Issled. Oper., Ser. 1, 2006 Volume 13, Issue 1, Pages 77–98 (Mi da25)

This article is cited in 7 papers

On enumeration of nonequivalent perfect binary codes of length 15 and rank 15

S. A. Malyugin

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences

Abstract: All nonequivalent perfect binary codes of length 15 and rank 15 are constructed that are obtained from the Hamming code $H^{15}$ by translating its disjoint components. Also, the main invariants of this class of codes are determined such as the ranks, dimensions of kernels, and orders of automorphism groups.

UDC: 519.72

Received: 11.11.2005


 English version:
Journal of Applied and Industrial Mathematics, 2007, 1:1, 77–89

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025