Simulation of a quasigroup error-detecting linear code

We analyze an error-detecting code with a fixed length redundancy, based on quasigroups. We obtain experimental results for the probability of undetected errors when quasigroups of different order are used for coding and conclude how the probability of undetected errors depends on the order of the quasigroup used for coding and the parameter of the code.