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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call