Skip to main content

New Decoding Algorithm for Cryptcodes Based on Quasigroups for Transmission Through a Low Noise Channel

  • Conference paper
  • First Online:
ICT Innovations 2017 (ICT Innovations 2017)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 778))

Included in the following conference series:

Abstract

Random Codes Based on Quasigroups (RCBQ) are cryptcodes, so they provide (in one algorithm) a correction of certain amount of errors in the input data and an information security. Cut-Decoding and 4-Sets-Cut-Decoding algorithms are proposed elsewhere and they improve decoding of these codes.

In the decoding process of these codes, three types of errors appear: more-candidate-error, null-error and undetected-error. More-candidate-errors can occur even all bits in the message are correctly transmitted. So, the packet-error (and bit-error) probability can be positive for very small bit-error probability in the noise channel. In order to eliminate this problem, here we define new decoding algorithms (called Fast-Cut-Decoding and Fast-4-Sets-Cut-Decoding algorithms) that enable more efficient and faster decoding, especially for transmission through a low noise channel. We present several experimental results obtained with these new algorithms. Also, we analyze the results for bit-error and packet-error probabilities and decoding speed when messages are transmitted through Gaussian channel with different values of signal-to-noise ratio (SNR).

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

References

  1. Gligoroski, D., Markovski, S., Kocarev, L.: Error-correcting codes based on quasigroups. In: Proceedings of 16th International Conference on Computer Communications and Networks, pp. 165–172 (2007)

    Google Scholar 

  2. Gligoroski, D., Markovski, S., Kocarev, L.: Totally asynchronous stream ciphers + Redundancy = Cryptcoding. In: Aissi, S., Arabnia, H.R. (eds.) Proceedings of the International Conference on Security and management, SAM 2007, pp. 446–451. CSREA Press, Las Vegas (2007)

    Google Scholar 

  3. Mechkaroska, D., Popovska-Mitrovikj, A., Bakeva, V.: Cryptcodes based on quasigroups in gaussian channel. Quasigroups Relat. Syst. 24(2), 249–268 (2016)

    MathSciNet  MATH  Google Scholar 

  4. Mathur, C.N., Narayan, K., Subbalakshmi, K.P.: High diffusion cipher: encryption and error correction in a single cryptographic primitive. In: Zhou, J., Yung, M., Bao, F. (eds.) ACNS 2006. LNCS, vol. 3989, pp. 309–324. Springer, Heidelberg (2006). doi:10.1007/11767480_21

    Chapter  Google Scholar 

  5. Popovska-Mitrovikj, A., Markovski, S., Bakeva, V.: Increasing the decoding speed of random codes based on quasigroups. In: Markovski, S., Gusev, M. (eds.) ICT Innovations 2012, Web proceedings, pp. 93–102 (2012). ISSN 1857–7288

    Google Scholar 

  6. Popovska-Mitrovikj, A., Markovski, S., Bakeva, V.: 4-Sets-Cut-Decoding algorithms for random codes based on quasigroups. Int. J. Electron. Commun. (AEU) 69(10), 1417–1428 (2015). Elsevier

    Article  MATH  Google Scholar 

  7. Popovska-Mitrovikj, A., Bakeva, V., Markovski, S.: On random error correcting codes based on quasigroups. Quasigroups Relat. Syst. 19(2), 301–316 (2011)

    MathSciNet  MATH  Google Scholar 

  8. Popovska-Mitrovikj, A., Markovski, S., Bakeva, V.: Performances of error-correcting codes based on quasigroups. In: Davcev, D., Gomez, J.M. (eds.) ICT-Innovations 2009, pp. 377–389. Springer, Heidelberg (2009)

    Google Scholar 

  9. Popovska-Mitrovikj, A., Markovski, S., Bakeva, V.: Some new results for random codes based on quasigroups. In: 10th Conference on Informatics and Information Technology with International Participants, Bitola, Macedonia, pp. 178–181 (2013)

    Google Scholar 

  10. Hwang, T., Rao, T.R.N.: Secret error-correcting codes (SECC). In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 540–563. Springer, New York (1990). doi:10.1007/0-387-34799-2_39

    Google Scholar 

  11. Zivic, N., Ruland, C.: Parallel joint channel coding and cryptography. Int. J. Electr. Electron. Eng. 4(2), 140–144 (2010)

    Google Scholar 

Download references

Acknowledgment

This research was partially supported by Faculty of Computer Science and Engineering at “Ss Cyril and Methodius” University in Skopje.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Aleksandra Popovska-Mitrovikj .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Popovska-Mitrovikj, A., Bakeva, V., Mechkaroska, D. (2017). New Decoding Algorithm for Cryptcodes Based on Quasigroups for Transmission Through a Low Noise Channel. In: Trajanov, D., Bakeva, V. (eds) ICT Innovations 2017. ICT Innovations 2017. Communications in Computer and Information Science, vol 778. Springer, Cham. https://doi.org/10.1007/978-3-319-67597-8_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-67597-8_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-67596-1

  • Online ISBN: 978-3-319-67597-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics