Skip to main content

Performances of Fast Algorithms for Random Codes Based on Quasigroups for Transmission of Audio Files in Gaussian Channel

  • Conference paper
  • First Online:
Book cover ICT Innovations 2018. Engineering and Life Sciences (ICT 2018)

Abstract

RCBQ are cryptcodes proposed in 2007. Since then, for improving performance of these codes for data transmission through a binary-symmetric and Gaussian channels, several new algorithms have been proposed. The last proposed Fast-Cut-Decoding and Fast-4-Sets-Cut-Decoding algorithm give the best results for transmission of ordinary messages. In this paper we consider performances of these codes for transmission of audio files in Gaussian channel for different values of signal-to-noise ratio (SNR). We present and compare experimental results for bit-error and packet-error probabilities obtained using fast algorithms of RCBQ. In all experiments differences between sent and decoded audio files are considered. Also, a filter for enhancing the quality of the decoded audio files is proposed. The proposed filter makes additional cleaning of the noise in the decoded files, enabling clearer listening to the original sound even after transmission through a channel with lower values of 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). https://doi.org/10.1007/11767480_21

    Chapter  MATH  Google Scholar 

  5. Popovska-Mitrovikj, A., Bakeva, V., Mechkaroska, D.: New decoding algorithm for cryptcodes based on quasigroups for transmission through a low noise channel. In: Trajanov, D., Bakeva, V. (eds.) ICT Innovations 2017. CCIS, vol. 778, pp. 196–204. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-67597-8_19

    Chapter  Google Scholar 

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

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

    Article  Google Scholar 

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

  9. Popovska-Mitrovikj, A., Markovski, S., Bakeva, V.: Performances of error-correcting codes based on quasigroups. In: Davcev, D., Gómez, J.M. (eds.) ICT Innovations 2009, pp. 377–389. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-10781-8_39

    Chapter  Google Scholar 

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

  11. 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). https://doi.org/10.1007/0-387-34799-2_39

    Chapter  Google Scholar 

  12. 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 Daniela Mechkaroska .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mechkaroska, D., Popovska-Mitrovikj, A., Smiljkova, V.B. (2018). Performances of Fast Algorithms for Random Codes Based on Quasigroups for Transmission of Audio Files in Gaussian Channel. In: Kalajdziski, S., Ackovska, N. (eds) ICT Innovations 2018. Engineering and Life Sciences. ICT 2018. Communications in Computer and Information Science, vol 940. Springer, Cham. https://doi.org/10.1007/978-3-030-00825-3_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-00825-3_24

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-00824-6

  • Online ISBN: 978-3-030-00825-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics