Skip to main content

Performances of Error-Correcting Codes Based on Quasigroups

  • Conference paper
ICT Innovations 2009 (ICT Innovations 2009)

Abstract

In this paper we examine some performances of error-correcting codes based on quasigroup transformations proposed elsewhere. In these error-correcting codes, there exists a correlation between any two bits of a codeword. Also, these codes are nonlinear and almost random. We give simulation results of packet-error and bit-error probability for binary symmetric channel and for several parameters of these codes. From these simulation results we can conclude that the performances of these codes depend on the used quasigroup, the length of the initial key and the way of introducing the redundant information.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Shannon, C.E.: A Mathematical Theory of Communication. Bell Sys. Tech. J. 27, 379–423, 623–656 (1948)

    Google Scholar 

  2. Markovski, S., Gligoroski, D., Bakeva, V.: Quasigroup String Processing: Part 1. Maced. Acad. of Sci. and Arts, Sc. Math. Tech. Scien. XX (1-2), 13–28 (1999)

    Google Scholar 

  3. Gligoroski, D., Markovski, S., Kocarev, L.j.: Totally Asynchronous Stream Ciphers + Redundancy = Cryptcoding. In: Aissi, S., Arabnia, H.R. (eds.) Proceedings of the 2007 International Conference on Security and management, SAM 2007, Las Vegas, June 25-28, pp. 446–451. CSREA Press (2007)

    Google Scholar 

  4. Gligoroski, D., Markovski, S., Kocarev, L.j.: Error-Correcting Codes Based on Quasigroups. In: Proceedings of 16th International Conference on Computer Communications and Networks (ICCCN 2007), August 13-16, pp. 165–172 (2007)

    Google Scholar 

  5. Dimitrova, V., Markovski, J.: On Quasigroup Pseudo Random Sequence Generators. In: Proceedings of the 1st Balkan Conference in Informatics, Thessaloniki, Greece, November 21-23, pp. 393–401 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Popovska-Mitrovikj, A., Markovski, S., Bakeva, V. (2010). Performances of Error-Correcting Codes Based on Quasigroups. In: Davcev, D., Gómez, J.M. (eds) ICT Innovations 2009. ICT Innovations 2009. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10781-8_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10781-8_39

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10780-1

  • Online ISBN: 978-3-642-10781-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics