When messages are transmitted through the communication channel, due to the noises in the channel, they can be incorrectly transmitted. Therefore, the receiver must ensure that it has the correct message. Similarly, the data stored in the storage media due to different circumstances can be corrupted. In order to check whether the data is corrupted or to check whether the receiver received the correct message, so-called error-detecting codes are used. When using such a code, it is important to know the power of the code to detect errors. In this paper we will analyze the ability to detect errors of one such error-detecting code. We compare the error-detecting capabilities of the code in a case when a quasigroup of order 4, order 8 and order 16 is used for coding for three different lengths of the redundancy. At the end we made a conclusion about the best choice of parameters from the aspect of the ability of the code to surely detect errors.
- Ilievska N., Gligoroski D., “Simulation of some new models of error-detecting codes,” Proceedings of the 22nd Telecommunications Forum Telfor, Belgrade, Serbia, 2014, pp. 395-398.
- Ilievska N., Gligoroski D., “Simulation of a Quasigroup Error- Detecting Linear Code,” Proceedings of the 38th International ICT Convention MIPRO CTI – Telecommunications & Information, Opatija, Croatia, 2015, pp. 483 – 488.
- Ilievska N., “Towards the Fixed Length Redundancy Code,” Proceedings of the 27th Telecommunications Forum Telfor, Belgrade, Serbia, 2019, pp. 241-244.
- Ilievska N., “Modeling the number of errors that the code surely detects,” Proceedings of the III International Scientific Conference Mathmodel, Borovets, Bulgaria, 2019.
- Ilievska N., “Towards the number of errors that the code detects for sure,” Journal of Engineering Science and Technology Review, accepted.