Cryptocodes Based on Quasigroups for Burst Channels

In this chapter we consider a modification of existing cryptocodes suitable for transmission in burst channels. For the simulation of burst errors, we use the Gilbert-Elliot model. We consider two kinds of Gilbert-Eliott channels, in the first one in each state the channel is binary-symmetric and in the second one, the channel is Gaussian. Experimental results for bit-error and packet-error probabilities obtained for different channel and code parameters are presented and we made a comparison of the results obtained with these burst algorithms and previously considered algorithms. Also, we investigate the performances of these algorithms for the transmission of images through a burst channel. In all experiments, for different values of bit-error probability (in BSC) and SNR (in Gaussian), the differences between transmitted and decoded images are considered. Further on, we consider an application of the filter for enhancing the quality of decoded images. With the considered filter clearer images are obtained. At the end of this chapter, we investigate an adoption of Fast-Cut-Decoding and Fast-4-Sets-Cut-Decoding algorithms for transmission through burst channels, called FastB-Cut-Decoding and FastB-4-Sets-Cut-Decoding algorithms.