Nonlinear Turbo Codes Based On Quasigroup String Processing

Spasov, Dejan (2012) Nonlinear Turbo Codes Based On Quasigroup String Processing. In: Proceedings of the Nineth Conference on Informatics and Information Technology. Faculty of Computer Science and Engineering, Ss. Cyril and Methodius University in Skopje, Macedonia, Skopje, Macedonia, pp. 221-225. ISBN 978-608-4699-01-9

[img]
Preview
Text
978-608-4699-01-9_pp221-225.pdf

Download (536kB) | Preview
Official URL: http://ciit.finki.ukim.mk

Abstract

Use of quasigroup transformations to build error-correcting codes was first proposed by Gligoroski, Markovski, and Kocarev [1]. However, their decoding algorithm was based on the exponential-time minimum-distance decoding algorithm, in which the brute-force search for the error pattern is confined in blocks of 16 bits and upper-bounded to two or three errors per block. We point out that any quasigroup-based error-correcting code, designed so far, can be modeled as finite state machine, thus it can be decoded in polynomial time with the well-known Viterbi algorithm or the MAP decoding algorithm. In order to improve the error-correcting capability of quasigroup codes, in this paper we build an error-correcting system based on the Turbo-code design principles. We present the error-correcting capabilities of our Turbo-code system over the Gaussian channel.

Item Type: Book Section
Subjects: International Conference on Informatics and Information Technologies > Security and Cryptography
Depositing User: Vangel Ajanovski
Date Deposited: 28 Oct 2016 00:15
Last Modified: 28 Oct 2016 00:15
URI: http://eprints.finki.ukim.mk/id/eprint/11078

Actions (login required)

View Item View Item