Simulation of the Quasigroup Redundancy Check Code’s Ability to Detect Errors
摘要
This paper contains experimental results for one important parameter of a code for error detection. The considered code is previously defined. In the definition of the check symbols is used algebraic structure quasigroup. In this paper will be considered the case when for coding are used quasigroups of order 8 for which the code has smallest probability of undetected errors. Namely, using simulations we will obtain experimental results for the largest number of erroneous bits up to which the code is guaranteed to detect errors when such quasigroup is used for coding. Since all these quasigroups are linear, we will conclude whether the free term has an influence on the value of this parameter.