|
Diskretnyi Analiz i Issledovanie Operatsii, Ser. 1, 2006, Volume 13, Issue 1, Pages 77–98
(Mi da25)
|
|
|
|
This article is cited in 7 scientific papers (total 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.
Received: 11.11.2005
Citation:
S. A. Malyugin, “On enumeration of nonequivalent perfect binary codes of length 15 and rank 15”, Diskretn. Anal. Issled. Oper., Ser. 1, 13:1 (2006), 77–98; J. Appl. Industr. Math., 1:1 (2007), 77–89
Linking options:
https://www.mathnet.ru/eng/da25 https://www.mathnet.ru/eng/da/v13/s1/i1/p77
|
Statistics & downloads: |
Abstract page: | 441 | Full-text PDF : | 100 | References: | 46 |
|