Error-correcting codes are widely used in modern coding theory, and their applications in networks and communication cannot be omitted. Together with the error detecting codes, they are the core of every possible transmission and communication. In coding theory, information theory and telecommunications, error-correcting codes are used to control errors in data which are transmitted over different communication channels. Convolutional block codes are one of the most popular error-correcting codes which are applied in many networks. On the other side, Random Codes Based on Quasigroups (RCBQ) are cryptcodes defined elsewhere. These codes provide a correction of a certain number of errors in the transmitted data and an information security in one algorithm. There are a few modifications of RCBQ, but here we will consider performances of Cut-Decoding algorithm. In this paper, we investigate and compare the bit error probability (BER) of these two codes for rate 1/4 and different values of bit-error probability in the binary symmetric channel. From the obtained experimental results, we conclude that for lower bit-error probability in the binary symmetric channel, the RCBQs are slightly better than convolutional codes. The advantage of RCBQs is that they have some cryptographic properties, but convolutional codes are faster than RCBQs.
- S. Mukherjee. Morgan Kaufmann. Architecture design for soft errors. (2011)
- L. Wang, G.W. Wornell, L. Zheng. IEEE Transactions on Information Theory. Fundamental limits of communication with low probability of detection. 62(6) 3493-3503. (2016)
- C. Beard, S. William. Pearson. Wireless communication networks and systems. (2015).
- A. Bensky. Newnes. Short-range wireless communication. (2019)
- https://www.cs.princeton.edu/courses/archive/spring18/cos463/lectures/L09-viterbi.pdf (27.05.2021)
- T. Richardson, U. Ruediger. Cambridge university press. Modern coding theory. (2008)
- D. Gligoroski, S. Markovski, Lj. Kocarev, Error-correcting codes based on quasigroups, in Procedings of 16th Intern. Confer. Computer Communications and Networks, ICCCN 2007, Honolulu, pp. 165-172. (2007)
- A. Popovska-Mitrovikj, S. Markovski, V. Bakeva, Increasing the decoding speed of random codes based on quasigroups'. in: S. Markovski, M. Gusev (Eds.), ICT Innovations 2012, Web proceedings, ISSN 1857-7288, 2012, pp. 93-102. (2012)
- D. Gligoroski, S. Markovski, Lj. Kocarev, Totally asynchronous stream ciphers + Redundancy = Cryptcoding. in: Aissi, S., Arabnia, H.R. (eds.), Proceedings of the International Conference on Security and management, SAM 2007, CSREA Press, Las Vegas, pp. 446-451. (2007)
- A. Popovska-Mitrovikj, S. Markovski, V. Bakeva, Performances of error-correcting codes based on quasigroups’, in Gómez, D., Davcev, J.M (Ed.) ICT innovations 2009, Springer, Berlin, Heidelberg, pp. 377–389 (2010)
- A. Popovska-Mitrovikj, S. Markovski,V. Bakeva, Increasing the decoding speed of random codes based on quasigroups, in Proceedings of ICT innovations 2012, pp. 93–102. (2012)
- A. Popovska-Mitrovikj, S. Markovski,V. Bakeva, Performances of error-correcting codes based on quasigroups. in: Davcev, D., Gomez, J.M. (eds.) ICT-Innovations 2009, pp. 377-389. Springer (2009)