Towards the Fixed Length Redundancy Code
Natasha Ilievska · 2019
In our previous work we have defined an error-detecting code with a fixed length of the redundancy. The analysed code is defined using the algebraic structure quasigroup. In this paper we analyse the case when a linear quasigroup of order 4 is used for coding. We obtain the number of errors that the code surely detects when the length of the redundancy is 8, 12 and 16 bits. At the end, we give some properties and conclusions for the number of errors that the code surely detects.