Number of Errors that the Error-Detecting Code Surely Detects

Abstract

In this paper we consider an error-detecting code based on linear quasigroups. We give a proof that the code is linear. Also, we obtain the generator and the parity-check matrices of the code, from where we obtain the Hamming distance of the code when a linear quasigroup of order 4 from the best class of quasigroups of order 4 for coding, i.e., the class of quasigroups of order 4 that gives smallest probability of undetected errors is used for coding. With this we determine the number of errors that the code will detect for sure.