Sciact
  • EN
  • RU

On switching equivalence of n-ary quasigroups of order 4 and perfect binary codes Full article

Journal Problems of Information Transmission
ISSN: 0032-9460 , E-ISSN: 1608-3253
Output data Year: 2010, Volume: 46, Number: 3, Pages: 219-224 Pages count : 6 DOI: 10.1134/s0032946010030026
Authors Krotov D.S. 1,2 , Potapov V.N. 1,2
Affiliations
1 Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Novosibirsk
2 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.
Cite: Krotov D.S. , Potapov V.N.
On switching equivalence of n-ary quasigroups of order 4 and perfect binary codes
Problems of Information Transmission. 2010. V.46. N3. P.219-224. DOI: 10.1134/s0032946010030026 WOS Scopus РИНЦ OpenAlex
Original: Кротов Д.С. , Потапов В.Н.
О свитчинговой эквивалентности n-арных квазигрупп порядка 4 и совершенных двоичных кодов
Проблемы передачи информации. 2010. Т.46. №3. С.22-28. РИНЦ
Dates:
Submitted: Nov 6, 2009
Accepted: May 14, 2010
Published online: Oct 19, 2010
Identifiers:
Web of science: WOS:000283175300002
Scopus: 2-s2.0-77958087568
Elibrary: 16980806
OpenAlex: W1997478971
Citing:
DB Citing
Web of science 2
Scopus 4
Elibrary 4
OpenAlex 3
Altmetrics: