Some new results for random codes based on quasigroups
Date Issued
2013
Author(s)
Popovska-Mitrovikj, Aleksandra
Abstract
In this paper we continue with our work on Random
codes based on quasigroups. Here, some modifications
of the encoding algorithm, where quasigroups of order 4
and order 256 are used, instead of quasigroups of order
16. We made simulations for binary symmetric channel,
for different quasigroups and different lengths of messages
and we find the packet-error probability (PER) and the
bit-error probability (BER). Also, we propose a method
for reducing the more-candidate-errors.
codes based on quasigroups. Here, some modifications
of the encoding algorithm, where quasigroups of order 4
and order 256 are used, instead of quasigroups of order
16. We made simulations for binary symmetric channel,
for different quasigroups and different lengths of messages
and we find the packet-error probability (PER) and the
bit-error probability (BER). Also, we propose a method
for reducing the more-candidate-errors.
Subjects
File(s)![Thumbnail Image]()
Loading...
Name
10CiiT-38.pdf
Size
143.49 KB
Format
Adobe PDF
Checksum
(MD5):746e66b07f67640663e4d020ef55a361
