|
Problemy Peredachi Informatsii, 2010, Volume 46, Issue 3, Pages 22–28
(Mi ppi2019)
|
|
|
|
This article is cited in 4 scientific papers (total in 4 papers)
Coding Theory
On switching equivalence of $n$-ary quasigroups of order 4 and perfect binary codes
D. S. Krotovab, V. N. Potapovab a Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
b Novosibirsk State University
Abstract:
We prove that arbitrary $n$-ary quasigroups of order 4 can be transformed into each other by successive switchings of $\{a,b\}$-components. We prove that perfect (closely packed) binary codes with distance 3 whose rank (dimension of the linear span) is greater by 1 or 2 than the rank of a linear perfect code can be taken to each other by successive switchings of $i$-components.
Received: 06.11.2009 Revised: 14.05.2010
Citation:
D. S. Krotov, V. N. Potapov, “On switching equivalence of $n$-ary quasigroups of order 4 and perfect binary codes”, Probl. Peredachi Inf., 46:3 (2010), 22–28; Problems Inform. Transmission, 46:3 (2010), 219–224
Linking options:
https://www.mathnet.ru/eng/ppi2019 https://www.mathnet.ru/eng/ppi/v46/i3/p22
|
Statistics & downloads: |
Abstract page: | 386 | Full-text PDF : | 87 | References: | 50 | First page: | 7 |
|