Anzeige
Erschienen in:
2017 | Supplement | Buchkapitel
New Decoding Algorithm for Cryptcodes Based on Quasigroups for Transmission Through a Low Noise Channel
verfasst von : Aleksandra Popovska-Mitrovikj, Verica Bakeva, Daniela Mechkaroska
Erschienen in: ICT Innovations 2017
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
Random Codes Based on Quasigroups (RCBQ) are cryptcodes, so they provide (in one algorithm) a correction of certain amount of errors in the input data and an information security. Cut-Decoding and 4-Sets-Cut-Decoding algorithms are proposed elsewhere and they improve decoding of these codes.
In the decoding process of these codes, three types of errors appear: more-candidate-error, null-error and undetected-error. More-candidate-errors can occur even all bits in the message are correctly transmitted. So, the packet-error (and bit-error) probability can be positive for very small bit-error probability in the noise channel. In order to eliminate this problem, here we define new decoding algorithms (called Fast-Cut-Decoding and Fast-4-Sets-Cut-Decoding algorithms) that enable more efficient and faster decoding, especially for transmission through a low noise channel. We present several experimental results obtained with these new algorithms. Also, we analyze the results for bit-error and packet-error probabilities and decoding speed when messages are transmitted through Gaussian channel with different values of signal-to-noise ratio (SNR).