4-Sets-Cut-Decoding algorithms for random codes based on quasigroups

The decoding speed is the biggest problem of random codes based on quasigroups proposed elsewhere. These codes are a combination of cryptographic algorithms and error-correcting codes. In our previous paper we proposed Cut-Decoding algorithm which is 4.5 times faster than the original one for code (...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of electronics and communications Jg. 69; H. 10; S. 1417 - 1428
Hauptverfasser: Popovska-Mitrovikj, Aleksandra, Markovski, Smile, Bakeva, Verica
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier GmbH 01.10.2015
Schlagworte:
Bit-error probability
Crypt-coding
Error-correcting code
Packet-error probability
Quasigroup
Random code
94A05
Crypt-coding
94B35
20N05
Packet-error probability
Quasigroup
68P30
94B60
Random code
Bit-error probability
Error-correcting code
ISSN:1434-8411, 1618-0399
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The decoding speed is the biggest problem of random codes based on quasigroups proposed elsewhere. These codes are a combination of cryptographic algorithms and error-correcting codes. In our previous paper we proposed Cut-Decoding algorithm which is 4.5 times faster than the original one for code (72,288). In this paper, four new modifications (so-called 4-Sets-Cut-Decoding algorithms) of this algorithm are proposed in order to obtain an improvement of the decoding speed. We present and analyze several experimental results obtained with different algorithms for random codes based on quasigroups. It is shown that using new algorithms, improvement of the efficiency and decoding speed is obtained. Also, we derive the upper bound for packet-error probability obtained with Cut-Decoding and 4-Sets-Cut-Decoding algorithm. At the end, some methods for reducing the number of unsuccessful decodings in the new proposed algorithms are considered.
ISSN:1434-8411
1618-0399
DOI:10.1016/j.aeue.2015.06.010