Abstract
RCBQ are cryptcodes proposed in 2007. After that, several papers for performances of these codes for transmission through a binary-symmetric and Gaussian channels, have been published. Also, for improving the performances of these codes several new algorithms have been defined. In this paper we proposed a new modification of existing cryptcodes obtaining new cryptcodes suitable for transmission in burst channels. For generating burst errors we use the model of Gilbert-Elliott burst channel. Experimental results for bit-error and packet-error probabilities obtained for different channel and code parameters are presented. Also, we made comparison of the results obtained with the old and the new algorithms for RCBQ.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Dimitrova, V., Markovski, J.: On quasigroup pseudo random sequence generators. In: Proceedings of 1st Balkan Conference in Informatics, Thessaloniki, Greece, pp. 393–401 (2003)
Gligoroski, D., Markovski, S., Kocarev, L.: Error-correcting codes based on quasigroups. In: Proceedings of 16th International Conference on Computer Communications and Networks, pp. 165–172 (2007)
Gligoroski, D., Markovski, S., Kocarev, L.: Totally asynchronous stream ciphers + redundancy = cryptcoding. In: Aissi, S., Arabnia, H.R. (eds.) Proceedings of the International Conference on Security and Management, SAM 2007, pp. 446–451. CSREA Press, Las Vegas (2007)
Knag, J., Stark, W., Hero, A.: Turbo codes for fading and burst channels. In: IEEE Theory Mini Conference, pp. 40–45 (1998)
Labiod, H.: Performance of Reed Solomon error-correcting codes on fading channels. In: IEEE International Conference on Personal Wireless Communications (Cat. No. 99TH8366), Jaipur, India, pp. 259–263 (1999)
Markovski, S., Gligoroski, D., Bakeva, V.: Quasigroup string processing: part 1. Contrib. Sect. Nat. Math. Biotech. Sci. 20(1–2), 13–28 (1999)
Markovski, S., Gligoroski, D., Kocarev, L.: Unbiased random sequences from quasigroup string transformations. In: Gilbert, H., Handschuh, H. (eds.) FSE 2005. LNCS, vol. 3557, pp. 163–180. Springer, Heidelberg (2005). https://doi.org/10.1007/11502760_11
Mathur, C.N., Narayan, K., Subbalakshmi, K.P.: High diffusion cipher: encryption and error correction in a single cryptographic primitive. In: Zhou, J., Yung, M., Bao, F. (eds.) ACNS 2006. LNCS, vol. 3989, pp. 309–324. Springer, Heidelberg (2006). https://doi.org/10.1007/11767480_21
Popovska-Mitrovikj, A., Markovski, S., Bakeva, V.: Increasing the decoding speed of random codes based on quasigroups. In: Markovski, S., Gusev, M. (eds.) ICT Innovations 2012, Web Proceedings, ISSN 1857–7288, pp. 93–102 (2012)
Popovska-Mitrovikj, A., Markovski, S., Bakeva, V.: 4-Sets-cut-decoding algorithms for random codes based on quasigroups. Int. J. Electron. Commun. (AEU) 69(10), 1417–1428 (2015)
Hwang, T., Rao, T.R.N.: Secret error-correcting codes (SECC). In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 540–563. Springer, New York (1990). https://doi.org/10.1007/0-387-34799-2_39
Zivic, N., Ruland, C.: Parallel joint channel coding and cryptography. Int. J. Electr. Electron. Eng. 4(2), 140–144 (2010)
Acknowledgment
This research was partially supported by Faculty of Computer Science and Engineering at “Ss Cyril and Methodius” University in Skopje.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Mechkaroska, D., Popovska-Mitrovikj, A., Bakeva, V. (2019). New Cryptcodes for Burst Channels. In: Ćirić, M., Droste, M., Pin, JÉ. (eds) Algebraic Informatics. CAI 2019. Lecture Notes in Computer Science(), vol 11545. Springer, Cham. https://doi.org/10.1007/978-3-030-21363-3_17
Download citation
DOI: https://doi.org/10.1007/978-3-030-21363-3_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-21362-6
Online ISBN: 978-3-030-21363-3
eBook Packages: Computer ScienceComputer Science (R0)