Performances of Error-Correcting Codes Based on Quasigroups

In this paper we examine some performances of error-correcting codes based on quasigroup transformations proposed elsewhere. In these error-correcting codes, there exists a correlation between any two bits of a codeword. Also, these codes are nonlinear and almost random. We give simulation results of packet-error and bit-error probability for binary symmetric channel and for several parameters of these codes. From these simulation results we can conclude that the performances of these codes depend on the used quasigroup, the length of the initial key and the way of introducing the redundant information.