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 (...

Full description

Saved in:

Bibliographic Details
Published in:	International journal of electronics and communications Vol. 69; no. 10; pp. 1417 - 1428
Main Authors:	Popovska-Mitrovikj, Aleksandra, Markovski, Smile, Bakeva, Verica
Format:	Journal Article
Language:	English
Published:	Elsevier GmbH 01.10.2015
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!