New cryptcodes for burst channels

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Mechkaroska, D., Popovska-Mitrovikj, A., & Bakeva, V. (2019). New cryptcodes for burst channels. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11545 LNCS, pp. 202–212). Springer Verlag. https://doi.org/10.1007/978-3-030-21363-3_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free