|
Discrete mathematics and mathematical cybernetics
On a class of perfect codes with maximum components
I. Yu. Mogilnykh, F. I. Solov'eva Sobolev Institute of Mathematics, pr. Koptyuga, 4, 630090, Novosibirsk, Russia
Abstract:
We show the existence of a wide class of binary extended perfect Solov'eva codes of length 16 with $ij$-components of maximum size.
Keywords:
perfect binary codes, component.
Received September 29, 2015, published August 15, 2016
Citation:
I. Yu. Mogilnykh, F. I. Solov'eva, “On a class of perfect codes with maximum components”, Sib. Èlektron. Mat. Izv., 13 (2016), 645–655
Linking options:
https://www.mathnet.ru/eng/semr701 https://www.mathnet.ru/eng/semr/v13/p645
|
Statistics & downloads: |
Abstract page: | 145 | Full-text PDF : | 38 | References: | 31 |
|