RUS  ENG
Full version
JOURNALS // Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports] // Archive

Sib. Èlektron. Mat. Izv., 2016 Volume 13, Pages 645–655 (Mi semr701)

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.

UDC: 519.725

MSC: 94B60

Received September 29, 2015, published August 15, 2016

DOI: 10.17377/semi.2016.13.051



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025